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

A KL-LUCB algorithm for Large-Scale Crowdsourcing NIPS 2017
Stochastic Submodular Maximization: The Case of Coverage Functions NIPS 2017
Stochastic Approximation for Canonical Correlation Analysis NIPS 2017
Near Optimal Sketching of Low-Rank Tensor Regression NIPS 2017
Fitting Low-Rank Tensors in Constant Time NIPS 2017
Large-Scale Quadratically Constrained Quadratic Program via Low-Discrepancy Sequences NIPS 2017
Efficient and Flexible Inference for Stochastic Systems NIPS 2017
Efficient Use of Limited-Memory Accelerators for Linear Learning on Heterogeneous Systems NIPS 2017
Minimal Exploration in Structured Stochastic Bandits NIPS 2017
Stochastic Mirror Descent in Variationally Coherent Optimization Problems NIPS 2017
Simple strategies for recovering inner products from coarsely quantized random projections NIPS 2017
Optimal Shrinkage of Singular Values Under Random Data Contamination NIPS 2017
Nonlinear Acceleration of Stochastic Algorithms NIPS 2017
A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis NIPS 2017
A Quantum-Inspired Ensemble Method and Quantum-Inspired Forest Regressors ACML 2017
Large-Scale Data-Dependent Kernel Approximation AISTATS 2017
ASAGA: Asynchronous Parallel SAGA AISTATS 2017
Nearly Instance Optimal Sample Complexity Bounds for Top-k Arm Selection AISTATS 2017
Less than a Single Pass: Stochastically Controlled Stochastic Gradient AISTATS 2017
Poisson intensity estimation with reproducing kernels AISTATS 2017
Removing Phase Transitions from Gibbs Measures AISTATS 2017
CPSG-MCMC: Clustering-Based Preprocessing method for Stochastic Gradient MCMC AISTATS 2017
Faster Coordinate Descent via Adaptive Importance Sampling AISTATS 2017
Hit-and-Run for Sampling and Planning in Non-Convex Spaces AISTATS 2017
Black-box Importance Sampling AISTATS 2017