Skip to content
conftrace_

Stochastic Methods

2,991 papers

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

Papers

EVSAC: Accelerating Hypotheses Generation by Modeling Matching Scores with Extreme Value Theory ICCV 2013 Expensive Function Optimization with Stochastic Binary Outcomes ICML 2013 Fast Algorithms for Gaussian Noise Invariant Independent Component Analysis NeurIPS 2013 Fast Determinantal Point Process Sampling with Application to Clustering NeurIPS 2013 Faster Ridge Regression via the Subsampled Randomized Hadamard Transform NeurIPS 2013 Fastfood - Computing Hilbert Space Expansions in loglinear time ICML 2013 Generalized Random Utility Models with Multiple Types NeurIPS 2013 High-Dimensional Gaussian Process Bandits NeurIPS 2013 Human Re-identification by Matching Compositional Template with Cluster Sampling ICCV 2013 Learning Social Infectivity in Sparse Low-rank Networks Using Multi-dimensional Hawkes Processes AISTATS 2013 Learning Triggering Kernels for Multi-dimensional Hawkes Processes ICML 2013 Local Privacy and Minimax Bounds: Sharp Rates for Probability Estimation NeurIPS 2013 Loss-Proportional Subsampling for Subsequent ERM ICML 2013 Metastability for High-Dimensional Walking Systems on Stochastically Rough Terrain RSS 2013 Mini-Batch Primal and Dual Methods for SVMs ICML 2013 Minimum Constraint Displacement Motion Planning RSS 2013 Mixed Optimization for Smooth Functions NeurIPS 2013 Modeling Information Propagation with Survival Theory ICML 2013 Near-optimal Batch Mode Active Learning and Adaptive Submodular Optimization ICML 2013 Near-Optimal Entrywise Sampling for Data Matrices NeurIPS 2013 New Subsampling Algorithms for Fast Least Squares Regression NeurIPS 2013 Non-rigid Structure from Motion with Diffusion Maps Prior CVPR 2013 Non-strongly-convex smooth stochastic approximation with convergence rate O(1/n) NeurIPS 2013 O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions ICML 2013 Online Kernel Learning with a Near Optimal Sparsity Bound ICML 2013