Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Ajay Jasra

dblp:29/4562 · DBLP profile ↗
← Back
5ranked-venue papers
0as first author
1since 2021 · last 2024
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 since 2021Databases, data management, data science and information retrieval · 1Graphics, computer vision, multimedia, augmented reality and games · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Probabilistic and Bayesian machine learning · 78% Optimization for machine learning · 19% Reinforcement learning · 4%
Theoretical computer science
1 paper
Mathematical optimization · 100%

Topics — the 10 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods
markov chain monte carlo
0.822024
On Unbiased Estimation for Partially Observed Diffusions · J. Mach. Learn. Res. 2024
Bayesian Policy Learning with Trans-Dimensional MCMC · NIPS 2007
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
expectation-maximization
0.812024
On Unbiased Estimation for Partially Observed Diffusions · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning
monte carlo methods
0.812024
On Unbiased Estimation for Partially Observed Diffusions · J. Mach. Learn. Res. 2024
Machine learning › Optimization for machine learning
stochastic gradient methods
0.812024
On Unbiased Estimation for Partially Observed Diffusions · J. Mach. Learn. Res. 2024
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › parameter estimation
unbiased estimation
0.812024
On Unbiased Estimation for Partially Observed Diffusions · J. Mach. Learn. Res. 2024
Mathematical optimization
continuous optimization
0.212024
On Unbiased Estimation for Partially Observed Diffusions · J. Mach. Learn. Res. 2024
Mathematical optimization › stochastic optimization
stochastic gradient methods
0.212024
On Unbiased Estimation for Partially Observed Diffusions · J. Mach. Learn. Res. 2024
Machine learning › Reinforcement learning › policy search
bayesian policy search
0.112007
Bayesian Policy Learning with Trans-Dimensional MCMC · NIPS 2007
Machine learning › Reinforcement learning
policy search
0.112007
Bayesian Policy Learning with Trans-Dimensional MCMC · NIPS 2007
Machine learning › Probabilistic and Bayesian machine learning › monte carlo methods › markov chain monte carlo
reversible jump MCMC
0.112007
Bayesian Policy Learning with Trans-Dimensional MCMC · NIPS 2007

Methods — techniques the papers use, named apart from their topics

multilevel randomization · 1.5coupling · 1.5conditional particle filters · 0.8conditional particle filter · 0.8reversible jump MCMC · 0.1expectation-maximization · 0.1
YearPublicationVenuePosition
2024 On Unbiased Estimation for Partially Observed Diffusions
abstract
We consider a class of diffusion processes with finite-dimensional parameters and partially observed at discrete time instances. We propose a methodology to unbiasedly estimate the expectation of a given functional of the diffusion process conditional on parameters and data. When these unbiased estimators with appropriately chosen functionals are employed within an expectation-maximization algorithm or a stochastic gradient method, this enables statistical inference using the maximum likelihood or Bayesian framework. Compared to existing approaches, the use of our unbiased estimators allows one to remove any time-discretization bias and Markov chain Monte Carlo burn-in bias. Central to our methodology is a novel and natural combination of multilevel randomization schemes and unbiased Markov chain Monte Carlo methods, and the development of new couplings of multiple conditional particle filters. We establish under assumptions that our estimators are unbiased and have finite variance. We illustrate various aspects of our method on an Ornstein--Uhlenbeck model, a logistic diffusion model for population dynamics, and a neural network model for grid cells.
Jeremy Heng, Jeremie Houssineau, Ajay Jasra
J. Mach. Learn. Res.3
2015 Extended finite-time H∞ control for uncertain switched linear neutral systems with time-varying delays
Tiange Shi, Lixian Zhang 0001, Ajay Jasra, Ming Zeng 0007
Neurocomputing4
2009 DECODE: a new method for discovering clusters of different densities in spatial data
Tao Pei, Ajay Jasra, David J. Hand, A-Xing Zhu, Chenghu Zhou
Data Min. Knowl. Discov.2
2007 Bayesian Policy Learning with Trans-Dimensional MCMC
abstract
A recently proposed formulation of the stochastic planning and control problem as one of parameter estimation for suitable artificial statistical models has led to the adoption of inference algorithms for this notoriously hard problem. At the algorithmic level, the focus has been on developing Expectation-Maximization (EM) algorithms. In this paper, we begin by making the crucial observation that the stochastic control problem can be reinterpreted as one of trans-dimensional inference. With this new interpretation, we are able to propose a novel reversible jump Markov chain Monte Carlo (MCMC) algorithm that is more efficient than its EM counterparts. Moreover, it enables us to implement full Bayesian policy search, without the need for gradients and with one single Markov chain. The new approach involves sampling directly from a distribution that is proportional to the reward and, consequently, performs better than classic simulations methods in situations where the reward is a rare event.
Matt Hoffman 0001, Arnaud Doucet, Nando de Freitas, Ajay Jasra
NIPS4
2006 Optimal Filtering For Partially Observed Point Processes Using Trans-Dimensional Sequential Monte Carlo
abstract
Continuous-time marked point processes appear in many areas of science and engineering including queuing theory, seismology, neuroscience and finance. In numerous applications, these point processes are unobserved but actually drive an observation process. Here, we are interested in optimal sequential Bayesian estimation of such partially observed point processes. This class of filtering problems is non-standard as there is typically no underlying Markov structure and the likelihood function relating the observations to the point process has a complex form. Hence, except in very specific cases it is impossible to solve them in closed-form. We develop an original trans-dimensional Sequential Monte Carlo method to address this class of problems. An application to partially observed queues is presented.
Arnaud Doucet, Luis Montesano, Ajay Jasra
ICASSP (5)3