conftrace_

stochastic method

95 papers

Explore in graph

Co-occurring keywords

convex optimization (1321) regret bound (1926) online learning (1777) non-convex optimization (547) markov chain monte carlo (725) stochastic optimization (1060) convergence rate (607) gradient descent (1144) distributed optimization (275) stochastic gradient descent (1091)

Papers

An Investigation Into the Stochasticity of Batch Whitening CVPR 2020
Sparse Parallel Training of Hierarchical Dirichlet Process Topic Models EMNLP 2020
Acceleration with a Ball Optimization Oracle NIPS 2020
On Testing of Samplers NIPS 2020
Dynamic Regret of Convex and Smooth Functions NIPS 2020
Regret Bounds without Lipschitz Continuity: Online Learning with Relative-Lipschitz Losses NIPS 2020
Bayesian Graph Neural Networks with Adaptive Connection Sampling ICML 2020
WONDER: Weighted One-shot Distributed Ridge Regression in High Dimensions JMLR 2020
Universal Approximation Property and Equivalence of Stochastic Computing-Based Neural Networks and Binary Neural Networks AAAI 2019
Efficiently avoiding saddle points with zero order methods: No gradients required NIPS 2019
Stochastic Runge-Kutta Accelerates Langevin Monte Carlo and Beyond NIPS 2019
RSN: Randomized Subspace Newton NIPS 2019
Differentially Private Empirical Risk Minimization with Smooth Non-Convex Loss Functions: A Non-Stationary View AAAI 2019
Sample Adaptive MCMC NIPS 2019
Efficient online learning with kernels for adversarial large scale problems NIPS 2019
Hadamard Response: Estimating Distributions Privately, Efficiently, and with Little Communication AISTATS 2019
Nonstochastic Multiarmed Bandits with Unrestricted Delays NIPS 2019
Real-Time Planning as Decision-Making under Uncertainty AAAI 2019
Submodular Function Minimization with Noisy Evaluation Oracle NIPS 2019
On Markov Chain Gradient Descent NIPS 2018
Minimax Bounds on Stochastic Batched Convex Optimization COLT 2018
Minimizing Adaptive Regret with One Gradient per Iteration IJCAI 2018
Direct Runge-Kutta Discretization Achieves Acceleration NIPS 2018
Horizon-Independent Minimax Linear Regression NIPS 2018
How To Make the Gradients Small Stochastically: Even Faster Convex and Nonconvex SGD NIPS 2018