conftrace_
← Keywords

stochastic optimization

1060 papers

Explore in graph

Also known as

SO

Co-occurring keywords

regret bound (1918) online learning (1770) variance reduction (520) multi-armed bandit (1091) convex optimization (1320) convergence rate (606) non-convex optimization (546) stochastic gradient descent (1088) gradient descent (1143) nonconvex optimization (316)

Papers

Mixture Content Selection for Diverse Sequence Generation IJCNLP 2019
Decentralized Optimization with Edge Sampling IJCAI 2019
Online Factorization and Partition of Complex Networks by Random Walk UAI 2019
Improving Law Enforcement Daily Deployment Through Machine Learning-Informed Optimization under Uncertainty IJCAI 2019
Stochastic Exposure Coding for Handling Multi-ToF-Camera Interference ICCV 2019
The Kelly Growth Optimal Portfolio with Ensemble Learning AAAI 2019
Perturbed-History Exploration in Stochastic Multi-Armed Bandits IJCAI 2019
HyperAdam: A Learnable Task-Adaptive Adam for Network Training AAAI 2019
Scalable Training of Inference Networks for Gaussian-Process Models ICML 2019
Asynchronous Delay-Aware Accelerated Proximal Coordinate Descent for Nonconvex Nonsmooth Problems AAAI 2019
A Contrastive Divergence for Combining Variational Inference and MCMC ICML 2019
Beyond Backprop: Online Alternating Minimization with Auxiliary Variables ICML 2019
Dissimilarity Coefficient Based Weakly Supervised Object Detection CVPR 2019
Think out of the "Box": Generically-Constrained Asynchronous Composite Optimization and Hedging NIPS 2019
Reducing the variance in online optimization by transporting past gradients NIPS 2019
A Latent Variational Framework for Stochastic Optimization NIPS 2019
A Generic Acceleration Framework for Stochastic Composite Optimization NIPS 2019
SpiderBoost and Momentum: Faster Variance Reduction Algorithms NIPS 2019
Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates NIPS 2019
Recovering Bandits NIPS 2019
Towards closing the gap between the theory and practice of SVRG NIPS 2019
Improved Regret Bounds for Bandit Combinatorial Optimization NIPS 2019
Constraint Solving and Optimization Using Evolutionary Techniques IJCAI 2019
A simple parameter-free and adaptive approach to optimization under a minimal local smoothness assumption ALT 2019
Learning Local Search Heuristics for Boolean Satisfiability NIPS 2019