Browsing MIT Open Access Articles by Title
Now showing items 2370-2389 of 55825
-
Approximate counting, the Lovasz local lemma, and inference in graphical models
(Association for Computing Machinery (ACM), 2017-06)In this paper we introduce a new approach for approximately counting in bounded degree systems with higher-order constraints. Our main result is an algorithm to approximately count the number of solutions to a CNF formula ... -
Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models
(Association for Computing Machinery (ACM), 2019)© 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM. In this article, we introduce a new approach to approximate counting in bounded degree systems with higher-order constraints. Our main result ... -
Approximate Counting, the Lovász Local Lemma, and Inference in Graphical Models
(Association for Computing Machinery (ACM), 2019)© 2019 Copyright held by the owner/author(s). Publication rights licensed to ACM. In this article, we introduce a new approach to approximate counting in bounded degree systems with higher-order constraints. Our main result ... -
Approximate Decentralized Bayesian Inference
(Association for Uncertainty in Artificial Intelligence Press, 2014-07)This paper presents an approximate method for performing Bayesian inference in models with conditional independence over a decentralized network of learning agents. The method first employs variational inference on each ... -
Approximate Distributed Spatiotemporal Topic Models for Multi-Robot Terrain Characterization
(Institute of Electrical and Electronics Engineers (IEEE), 2019-01)Unsupervised learning techniques, such as Bayesian topic models, are capable of discovering latent structure directly from raw data. These unsupervised models can endow robots with the ability to learn from their observations ... -
An approximate dynamic programming approach to solving dynamic oligopoly models
(Wiley Blackwell, 2012-06)In this article, we introduce a new method to approximate Markov perfect equilibrium in large-scale Ericson and Pakes (1995)-style dynamic oligopoly models that are not amenable to exact solution due to the curse of ... -
Approximate Dynamic Programming Using Bellman Residual Elimination and Gaussian Process Regression
(Institute of Electrical and Electronics Engineers, 2009-07)This paper presents an approximate policy iteration algorithm for solving infinite-horizon, discounted Markov decision processes (MDPs) for which a model of the system is available. The algorithm is similar in spirit to ... -
Approximate Dynamic Programming Using Bellman Residual Elimination and Gaussian Process Regression
(Institute of Electrical and Electronics Engineers, 2009-07)This paper presents an approximate policy iteration algorithm for solving infinite-horizon, discounted Markov decision processes (MDPs) for which a model of the system is available. The algorithm is similar in spirit to ... -
Approximate dynamic programming using model-free Bellman Residual Elimination
(Institute of Electrical and Electronics Engineers / American Automatic Control Council, 2010-06)This paper presents an modification to the method of Bellman Residual Elimination (BRE) for approximate dynamic programming. While prior work on BRE has focused on learning an approximate policy for an underlying Markov ... -
Approximate Dynamic Programming via a Smoothed Linear Program
(Institute for Operations Research and the Management Sciences (INFORMS), 2012-05)We present a novel linear program for the approximation of the dynamic programming cost-to-go function in high-dimensional stochastic control problems. LP approaches to approximate DP have typically relied on a natural ... -
An approximate empirical Bayesian method for large-scale linear-Gaussian inverse problems
(IOP Publishing, 2018-06)We study Bayesian inference methods for solving linear inverse problems, focusing on hierarchical formulations where the prior or the likelihood function depend on unspecified hyperparameters. In practice, these hyperparameters ... -
Approximate hybrid model predictive control for multi-contact push recovery in complex environments
(IEEE, 2017-11)Feedback control of robotic systems interacting with the environment through contacts is a central topic in legged robotics. One of the main challenges posed by this problem is the choice of a model sufficiently complex ... -
Approximate inference in additive factorial HMMs with application to energy disaggregation
(Proceedings of Machine Learning Research, 2012-04)This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function of all the hidden states. Although such ... -
Approximate insightful ODE solutions
(American Association of Physics Teachers (AAPT), 2022-12) -
Approximate inversion of the wave-equation Hessian via randomized matrix probing
(Society of Exploration Geophysicists, 2012)We present a method for approximately inverting the Hessian of full waveform inversion as a dip-dependent and scale-dependent amplitude correction. The terms in the expansion of this correction are determined by least-squares ... -
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
(Theory of Computing Exchange, 2012) -
Approximate Nearest Neighbor: Towards Removing the Curse of Dimensionality
(Theory of Computing Exchange, 2012) -
Approximate orthogonality of permutation operators, with application to quantum information
(Springer Netherlands, 2023-12-16)Consider the n! different unitary matrices that permute n d-dimensional quantum systems. If $$d\ge n$$ ... -
Approximate policy iteration: A survey and some new methods
(Springer-Verlag, 2011-08)We consider the classical policy iteration method of dynamic programming (DP), where approximations and simulation are used to deal with the curse of dimensionality. We survey a number of issues: convergence and rate of ... -
Approximate polymorphisms
(ACM, 2022-06-09)