conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Stochastic Methods

2,788 papers

Papers per year

1
2
23
82
292
98
'00
'05
'10
'15
'20
'25

Papers

Generalized Score Matching for Non-Negative Data JMLR 2019
Optimal Transport: Fast Probabilistic Approximation with Exact Solvers JMLR 2019
More Efficient Estimation for Logistic Regression with Optimal Subsamples JMLR 2019
Nonparametric Estimation of Probability Density Functions of Random Persistence Diagrams JMLR 2019
Approximation Algorithms for Stochastic Clustering JMLR 2019
A Kernel Multiple Change-point Algorithm via Model Selection JMLR 2019
On the Convergence of Gaussian Belief Propagation with Nodes of Arbitrary Size JMLR 2019
Stochastic Canonical Correlation Analysis JMLR 2019
Differentiable reservoir computing JMLR 2019
Log-concave sampling: Metropolis-Hastings algorithms are fast JMLR 2019
Shenango: Achieving High CPU Efficiency for Latency-sensitive Datacenter Workloads NSDI 2019
Stable and Practical AS Relationship Inference with ProbLink NSDI 2019
Highly Parallelized Data-Driven MPC for Minimal Intervention Shared Control RSS 2019
Reachable Space Characterization of Markov Decision Processes with Time Variability RSS 2019
Perturbed-History Exploration in Stochastic Linear Bandits UAI 2019
Sinkhorn AutoEncoders UAI 2019
Empirical Mechanism Design: Designing Mechanisms from Data UAI 2019
Contour location via entropy reduction leveraging multiple information sources NIPS 2018
On Markov Chain Gradient Descent NIPS 2018
Parameters as interacting particles: long time convergence and asymptotic error scaling of neural networks NIPS 2018
Asymptotic optimality of adaptive importance sampling NIPS 2018
Solving Non-smooth Constrained Programs with Lower Complexity than $\mathcal{O}(1/\varepsilon)$: A Primal-Dual Homotopy Smoothing Approach NIPS 2018
Implicit Probabilistic Integrators for ODEs NIPS 2018
Inferring Networks From Random Walk-Based Node Similarities NIPS 2018
The Convergence of Sparsified Gradient Methods NIPS 2018