Filters








294,892 Hits in 6.1 sec

ADJUSTED VITERBI TRAINING

Jüri Lember, Alexey Koloydenko
2007 Probability in the engineering and informational sciences (Print)  
This paper is however motivated by applications where EM is replaced by Viterbi training, or extraction (VT), also known as the Baum-Viterbi algorithm.  ...  The EM algorithm is a principal tool for parameter estimation in the hidden Markov models, where its efficient implementation is known as the Baum-Welch algorithm.  ...  Based on the function obtained above, we apply the adjusted Viterbi training and compare it with the VT and EM algorithms.  ... 
doi:10.1017/s0269964807000083 fatcat:x5asomvfyrfu7jes6mejr6eclq

Concept adjustment for description logics

Yue Ma, Felix Distel
2013 Proceedings of the seventh international conference on Knowledge capture - K-CAP '13  
However, concept descriptions generated in this manner can contain false information, which is harmful when added to a formal knowledge base.  ...  Then, we show how it can be reduced to SAT, yielding a practical algorithm for its solution.  ...  For implementation, we have studied an encoding based approach which can reduce the concept adjustment problems to a SAT instance.  ... 
doi:10.1145/2479832.2479851 dblp:conf/kcap/MaD13 fatcat:nqmrtr2razghzjoci5whl2hoka

Self-adjusting computation

Umut A. Acar
2008 Proceedings of the 2009 ACM SIGPLAN workshop on Partial evaluation and program manipulation - PEPM '09  
From the algorithmic perspective, we describe novel data structures for tracking the dependences in a computation and a change-propagation algorithm for adjusting computations to changes.  ...  Our applications include a random sampling algorithm on lists, the quick sort and merge sort algorithms, the Graham's Scan and the quick algorithm for planar convex hull, and the tree-contraction algorithm  ...  The algorithm relies on the ListCombine structure for finding the leftmost and the rightmost points, as well as the point farthest away from a line.  ... 
doi:10.1145/1480945.1480946 dblp:conf/pepm/Acar09 fatcat:dkt7ohj7zffjhgojqgn3pl4lwq

Self-adjusting computation

R. Harper
2004 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004.  
From the algorithmic perspective, we describe novel data structures for tracking the dependences in a computation and a change-propagation algorithm for adjusting computations to changes.  ...  Our applications include a random sampling algorithm on lists, the quick sort and merge sort algorithms, the Graham's Scan and the quick algorithm for planar convex hull, and the tree-contraction algorithm  ...  The algorithm relies on the ListCombine structure for finding the leftmost and the rightmost points, as well as the point farthest away from a line.  ... 
doi:10.1109/lics.2004.1319619 dblp:conf/lics/Harper04 fatcat:vvjwu4dq6nd7hpqgfhpk63pjrq

Self-Adjusting Computation [chapter]

Robert Harper
2004 Lecture Notes in Computer Science  
From the algorithmic perspective, we describe novel data structures for tracking the dependences in a computation and a change-propagation algorithm for adjusting computations to changes.  ...  Our applications include a random sampling algorithm on lists, the quick sort and merge sort algorithms, the Graham's Scan and the quick algorithm for planar convex hull, and the tree-contraction algorithm  ...  The algorithm relies on the ListCombine structure for finding the leftmost and the rightmost points, as well as the point farthest away from a line.  ... 
doi:10.1007/978-3-540-27836-8_1 fatcat:6tqe22fqhbejvna265jg7mddwa

Graph layout adjustment strategies [chapter]

Margaret -Anne D. Storey, Hausi A. Müller
1996 Lecture Notes in Computer Science  
This algorithm preserves straightness of lines and uniformly resizes nodes when requests for more screen space are made. In contrast to other layout adjustment a!  ...  A layout adjustment algorithm which can be used to create fisheye views of nested graphs is introduced.  ...  Acknowledgments The authors gratefully thank Bryan Gilbert, James McDaniel and Minou Bhargava for editing suggestions.  ... 
doi:10.1007/bfb0021833 fatcat:7l5fxqxvdbdg7blbvquwitmuqm

Meta-Learning by Adjusting Priors Based on Extended PAC-Bayes Theory [article]

Ron Amit, Ron Meir
2019 arXiv   pre-print
In meta-learning an agent extracts knowledge from observed tasks, aiming to facilitate learning of novel future tasks.  ...  Thus, prior knowledge is incorporated through setting an experience-dependent prior for novel tasks.  ...  ACKNOWLEDGMENTS We thank Asaf Cassel, Guy Tennenholtz, Baruch Epstein, Daniel Soudry, Elad Hoffer and Tom Zahavy for helpful discussions of this work, and the anonymous reviewers for their helpful comment  ... 
arXiv:1711.01244v8 fatcat:uvbegjw6erezjebbinjrrejzpe

On Adjusted Viterbi Training

Alexey Koloydenko, Meelis Käärik, Jüri Lember
2007 Acta Applicandae Mathematicae - An International Survey Journal on Applying Mathematics and Mathematical Applications  
This paper is however motivated by applications where EM is replaced by Viterbi training, or extraction (VT), also known as the Baum-Viterbi algorithm.  ...  The EM algorithm is a principal tool for parameter estimation in the hidden Markov models, where its efficient implementation is known as the Baum-Welch algorithm.  ...  Based on the function obtained above, we apply the adjusted Viterbi training and compare it with the VT and EM algorithms.  ... 
doi:10.1007/s10440-007-9102-5 fatcat:xqf6nv26wngmxhd2qybtx6vw3y

Hyperparameter Transfer Across Developer Adjustments [article]

Danny Stoll, Jörg K.H. Franke, Diane Wagner, Simon Selg, Frank Hutter
2020 arXiv   pre-print
After developer adjustments to a machine learning (ML) algorithm, how can the results of an old hyperparameter optimization (HPO) automatically be used to speedup a new HPO?  ...  To lay a solid foundation for this research framework, we provide four simple HT-AA baseline algorithms and eight benchmarks changing various aspects of ML algorithms, their hyperparameter search spaces  ...  Robert Bosch GmbH is acknowledged for financial support.  ... 
arXiv:2010.13117v1 fatcat:7kelwh3uwvceffakz3c23oqqwa

A Dynamic Adjusting Reward Function Method for Deep Reinforcement Learning with Adjustable Parameters

Zijian Hu, Kaifang Wan, Xiaoguang Gao, Yiwei Zhai
2019 Mathematical Problems in Engineering  
MSR dynamically adjusts the rewards for experience with reward saltation in the experience pool, thereby increasing an agent's utilization of these experiences.  ...  For an environment with reward saltation, we propose a magnify saltatory reward (MSR) algorithm with variable parameters from the perspective of sample usage.  ...  Wan for the discussions. is study was supported by the National Natural Science Foundation of China (grant no. 61573285) and the Science and Technology on Avionics Integration Laboratory and Aeronautical  ... 
doi:10.1155/2019/7619483 fatcat:wgcvlxskr5djzbfrnouuliwt3m

Seasonal Adjustment with theRPackagesx12andx12GUI

Alexander Kowarik, Angelika Meraner, Matthias Templ, Daniel Schopfhauser
2014 Journal of Statistical Software  
The original output from X-12-ARIMA is somehow static and it is not always an easy task for users to extract the required information for further processing.  ...  The procedure makes additive or multiplicative adjustments and creates an output data set containing the adjusted time series and intermediate calculations.  ...  For preadjusting the series, an algorithm based on TRAMO (time series regression with ARIMA noise, missing observations and outliers) is used by X-12-ARIMA (see e.g., Maravall 2003) .  ... 
doi:10.18637/jss.v062.i02 fatcat:5i4qzsojsfafdbtslsvmok3vya

Salient Bundle Adjustment for Visual SLAM [article]

Ke Wang, Sai Ma, Junlan Chen, Jianbo Lu
2020 arXiv   pre-print
Then, we proposed Salient Bundle Adjustment by using the value of saliency map as the weight of the feature points in traditional Bundle Adjustment approach.  ...  Finally, we will make our saliency dataset and relevant source code open-source for enabling future research.  ...  Algorithm 1 1 The Algorithm for saliency map prediction.  ... 
arXiv:2012.11863v1 fatcat:e6mrc6nnfnhutbi6a4y7bn7qz4

Mining association rules with adjustable accuracy

Jong Soo Park, Philip S. Yu, Ming-Syan Chen
1997 Proceedings of the sixth international conference on Information and knowledge management - CIKM '97  
In this paper, we devise efficient algorithms for mining association rules with adjustable accuracy.  ...  In this paper, two methods for mining association rules with adjustable accuracy are developed.  ...  In this paper, we devise efficient algorithms for mining association rules with adjustable accuracy to the mathematical formulation.  ... 
doi:10.1145/266714.266886 dblp:conf/cikm/ParkYC97 fatcat:qxqiwjg3nrcdpi4wqel36lfchm

Bundle Adjustment for Stereoscopic 3D [chapter]

Christian Kurz, Thorsten Thormählen, Hans-Peter Seidel
2011 Lecture Notes in Computer Science  
In order to ensure a high accuracy of the estimated camera parameters, a bundle adjustment algorithm should be employed. We present a new stereo camera model for bundle adjustment.  ...  The recent resurgence of stereoscopic 3D films has triggered a high demand for post-processing tools for stereoscopic image sequences.  ...  However, the employed algorithms are not published and an academic paper presenting a solution to high quality camera motion estimation for stereo cameras is (to the best of our knowledge) not yet available  ... 
doi:10.1007/978-3-642-24136-9_1 fatcat:2gk6htejz5h5vgadazn4opucyu

Experience, adjustment, and engagement

Joe Tullio, Elaine Huang, David Wheatley, Harry Zhang, Claudia Guerrero, Amruta Tamdoo
2010 Proceedings of the 28th international conference on Human factors in computing systems - CHI '10  
We discuss the need to incorporate human experience and tacit knowledge, operator engagement, and the greater ecosystem of work into video deployments.  ...  Questions about the effectiveness of increasingly ubiquitous video technology in law enforcement have prompted an examination of the practices surrounding this technology.  ...  We also thank Crysta Metcalf, Ken Douros, and Khai Truong for their support and feedback on this research.  ... 
doi:10.1145/1753326.1753551 dblp:conf/chi/TullioHWZGT10 fatcat:p6cixhbuuzf5jfpqvaqce7nqdq
« Previous Showing results 1 — 15 out of 294,892 results