Skip to content
conftrace_

Stochastic Methods

2,991 papers

1
2
23
84
299
198
2000
'5
'10
'15
'20
'25

Papers

Efficiently avoiding saddle points with zero order methods: No gradients required NeurIPS 2019 Efficient Non-parametric Bayesian Hawkes Processes IJCAI 2019 Efficient Optimal Approximation of Discrete Random Variables for Estimation of Probabilities of Missing Deadlines AAAI 2019 Efficient Pure Exploration in Adaptive Round model NeurIPS 2019 Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent NeurIPS 2019 Elliptical Perturbations for Differential Privacy NeurIPS 2019 Empirical Mechanism Design: Designing Mechanisms from Data UAI 2019 Enhancing Evolutionary Conversion Rate Optimization via Multi-Armed Bandit Algorithms AAAI 2019 Equilibrium Characterization for Data Acquisition Games IJCAI 2019 Estimate Sequences for Variance-Reduced Stochastic Composite Optimization ICML 2019 Estimating Entropy of Distributions in Constant Space NeurIPS 2019 Estimating the Mixing Time of Ergodic Markov Chains COLT 2019 Evolutionary Manytasking Optimization Based on Symbiosis in Biocoenosis AAAI 2019 Evolving Solutions to Community-Structured Satisfiability Formulas AAAI 2019 Exact sampling of determinantal point processes with sublinear time preprocessing NeurIPS 2019 Exploiting structure of uncertainty for efficient matroid semi-bandits ICML 2019 Fast Algorithm for Generalized Multinomial Models with Ranking Data ICML 2019 Fast determinantal point processes via distortion-free intermediate sampling COLT 2019 Faster First-Order Methods for Stochastic Non-Convex Optimization on Riemannian Manifolds AISTATS 2019 Faster Gradient-Free Proximal Stochastic Methods for Nonconvex Nonsmooth Optimization AAAI 2019 Faster Stochastic Alternating Direction Method of Multipliers for Nonconvex Optimization ICML 2019 Fast Parallel Algorithms for Statistical Subset Selection Problems NeurIPS 2019 Fast Stochastic Algorithms for Low-rank and Nonsmooth Matrix Problems AISTATS 2019 Finite-Time Error Bounds For Linear Stochastic Approximation andTD Learning COLT 2019 Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits ICML 2019