{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/stochastic-optimization/papers/14","list_of":"/task/stochastic-optimization","task":"Stochastic Optimization","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":14,"pages_in_order":14,"rows_per_page":100,"rows":[1301,1387],"of":1387,"counts":{"archive_papers_tagged":1387,"with_a_code_link":337,"where_syntology_ran_a_sample":91,"not_listed_spam_title":0,"listed":1387,"listed_where_code_ran":91,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":75,"every_run_a_failure_of_syntologys_instrument":16,"listed_with_a_run_with_no_instrument_failure":75,"listed_every_run_a_failure_of_syntologys_instrument":16,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/stochastic-optimization","prev":"/task/stochastic-optimization/papers/13","next":null,"papers":[{"url":null,"slug":"adaptive-stochastic-optimization-from-sets-to","title":"Adaptive Stochastic Optimization: From Sets to Paths","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-stochastic-convex-optimization-1","title":"Asynchronous stochastic convex optimization: the noise is in the noise and SGD don't care","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-rates-for-exp-concave-empirical-risk","title":"Fast Rates for Exp-concave Empirical Risk Minimization","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"local-smoothness-in-variance-reduced","title":"Local Smoothness in Variance Reduced Optimization","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"constant-time-expected-similarity-estimation","title":"Constant Time EXPected Similarity Estimation using Stochastic Optimization","date":"2015-11-17","arxiv_id":"1511.05371","repositories_listed":0,"syntology":null},{"url":null,"slug":"joint-training-of-generic-cnn-crf-models-with","title":"Joint Training of Generic CNN-CRF Models with Stochastic Optimization","date":"2015-11-16","arxiv_id":"1511.05067","repositories_listed":0,"syntology":null},{"url":null,"slug":"large-scale-approximate-kernel-canonical","title":"Large-Scale Approximate Kernel Canonical Correlation Analysis","date":"2015-11-15","arxiv_id":"1511.04773","repositories_listed":0,"syntology":null},{"url":null,"slug":"seeing-the-unseen-network-inferring-hidden","title":"Seeing the Unseen Network: Inferring Hidden Social Ties from Respondent-Driven Sampling","date":"2015-11-13","arxiv_id":"1511.04137","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-principal-component-analysis-in-high","title":"Online Principal Component Analysis in High Dimension: Which Algorithm to Choose?","date":"2015-11-11","arxiv_id":"1511.03688","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-proximal-gradient-descent-for","title":"Stochastic Proximal Gradient Descent for Nuclear Norm Regularization","date":"2015-11-05","arxiv_id":"1511.01664","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-shift-and-invert-preconditioning","title":"Robust Shift-and-Invert Preconditioning: Faster and More Sample Efficient Algorithms for Eigenvector Computation","date":"2015-10-29","arxiv_id":"1510.08896","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-for-gaussian-processes-via","title":"Optimization for Gaussian Processes via Chaining","date":"2015-10-19","arxiv_id":"1510.05576","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-deep-cca-via","title":"Stochastic Optimization for Deep CCA via Nonlinear Orthogonal Iterations","date":"2015-10-07","arxiv_id":"1510.02054","repositories_listed":0,"syntology":null},{"url":null,"slug":"stable-robbins-monro-approximations-through","title":"The Proximal Robbins-Monro Method","date":"2015-10-04","arxiv_id":"1510.00967","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-machine-wald","title":"Towards Machine Wald","date":"2015-08-10","arxiv_id":"1508.02449","repositories_listed":0,"syntology":null},{"url":null,"slug":"particle-swarm-optimization-for-weighted-sum","title":"Particle Swarm Optimization for Weighted Sum Rate Maximization in MIMO Broadcast Channels","date":"2015-08-04","arxiv_id":"1508.01168","repositories_listed":0,"syntology":null},{"url":null,"slug":"perturbed-iterate-analysis-for-asynchronous","title":"Perturbed Iterate Analysis for Asynchronous Stochastic Optimization","date":"2015-07-24","arxiv_id":"1507.06970","repositories_listed":0,"syntology":null},{"url":null,"slug":"asoc-an-adaptive-parameter-free-stochastic","title":"ASOC: An Adaptive Parameter-free Stochastic Optimization Techinique for Continuous Variables","date":"2015-06-26","arxiv_id":"1506.08004","repositories_listed":0,"syntology":null},{"url":null,"slug":"finding-linear-structure-in-large-datasets","title":"Finding Linear Structure in Large Datasets with Scalable Canonical Correlation Analysis","date":"2015-06-26","arxiv_id":"1506.08170","repositories_listed":0,"syntology":null},{"url":null,"slug":"copula-variational-inference","title":"Copula variational inference","date":"2015-06-10","arxiv_id":"1506.03159","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-sgd-using-sketched-conditioning","title":"Faster SGD Using Sketched Conditioning","date":"2015-06-08","arxiv_id":"1506.02649","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-asynchronous-mini-batch-algorithm-for","title":"An Asynchronous Mini-Batch Algorithm for Regularized Stochastic Optimization","date":"2015-05-18","arxiv_id":"1505.04824","repositories_listed":0,"syntology":null},{"url":null,"slug":"building-proteins-in-a-day-efficient-3d","title":"Building Proteins in a Day: Efficient 3D Molecular Reconstruction","date":"2015-04-14","arxiv_id":"1504.03573","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparse-linear-regression-with-missing-data","title":"Sparse Linear Regression With Missing Data","date":"2015-03-28","arxiv_id":"1503.08348","repositories_listed":0,"syntology":null},{"url":null,"slug":"fusion-of-image-segmentation-algorithms-using","title":"Fusion of Image Segmentation Algorithms using Consensus Clustering","date":"2015-02-18","arxiv_id":"1502.05435","repositories_listed":0,"syntology":null},{"url":null,"slug":"microscopic-advances-with-large-scale","title":"Microscopic Advances with Large-Scale Learning: Stochastic Optimization for Cryo-EM","date":"2015-01-19","arxiv_id":"1501.04656","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-trading-with-alpha-predictors","title":"Optimal Trading with Alpha Predictors","date":"2015-01-16","arxiv_id":"1501.03756","repositories_listed":0,"syntology":null},{"url":null,"slug":"communication-efficient-distributed","title":"Communication-Efficient Distributed Optimization of Self-Concordant Empirical Loss","date":"2015-01-01","arxiv_id":"1501.00263","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-stochastic-gradient-descent-on-the","title":"Adaptive Stochastic Gradient Descent on the Grassmannian for Robust Low-Rank Subspace Recovery and Clustering","date":"2014-12-12","arxiv_id":"1412.4044","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-filtering-approach-to-stochastic","title":"A Filtering Approach to Stochastic Variational Inference","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-mini-batch-randomized-block","title":"Accelerated Mini-batch Randomized Block Coordinate Descent Method","date":"2014-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-variational-inference-for-hidden","title":"Stochastic Variational Inference for Hidden Markov Models","date":"2014-11-06","arxiv_id":"1411.1670","repositories_listed":0,"syntology":null},{"url":null,"slug":"stability-and-performance-limits-of-adaptive","title":"Stability and Performance Limits of Adaptive Primal-Dual Networks","date":"2014-08-16","arxiv_id":"1408.3693","repositories_listed":0,"syntology":null},{"url":null,"slug":"block-stochastic-gradient-iteration-for","title":"Block stochastic gradient iteration for convex and nonconvex optimization","date":"2014-08-12","arxiv_id":"1408.2597","repositories_listed":0,"syntology":null},{"url":null,"slug":"exploiting-smoothness-in-statistical-learning","title":"Exploiting Smoothness in Statistical Learning, Sequential Prediction, and Stochastic Optimization","date":"2014-07-19","arxiv_id":"1407.5908","repositories_listed":0,"syntology":null},{"url":null,"slug":"randomized-block-coordinate-descent-for","title":"Randomized Block Coordinate Descent for Online and Stochastic Optimization","date":"2014-07-01","arxiv_id":"1407.0107","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-stochastic-optimization-of-the","title":"Distributed Stochastic Optimization of the Regularized Risk","date":"2014-06-17","arxiv_id":"1406.4363","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-gradients-for-stochastic-variational","title":"Smoothed Gradients for Stochastic Variational Inference","date":"2014-06-13","arxiv_id":"1406.3650","repositories_listed":0,"syntology":null},{"url":null,"slug":"universal-convexification-via-risk-aversion","title":"Universal Convexification via Risk-Aversion","date":"2014-06-03","arxiv_id":"1406.0554","repositories_listed":0,"syntology":null},{"url":"/paper/realtime-and-robust-hand-tracking-from-depth","slug":"realtime-and-robust-hand-tracking-from-depth","title":"Realtime and Robust Hand Tracking from Depth","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-learning-for-taxonomy-induction","title":"Structured Learning for Taxonomy Induction with Belief Propagation","date":"2014-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"proximal-reinforcement-learning-a-new-theory","title":"Proximal Reinforcement Learning: A New Theory of Sequential Decision Making in Primal-Dual Spaces","date":"2014-05-26","arxiv_id":"1405.6757","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-comparison-of-monte-carlo-tree-search-and","title":"A Comparison of Monte Carlo Tree Search and Mathematical Optimization for Large Scale Dynamic Resource Allocation","date":"2014-05-21","arxiv_id":"1405.5498","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-stochastic-variational-inference","title":"Structured Stochastic Variational Inference","date":"2014-04-16","arxiv_id":"1404.4114","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-stochastic-optimization-under","title":"Online Stochastic Optimization under Correlated Bandit Feedback","date":"2014-02-04","arxiv_id":"1402.0562","repositories_listed":0,"syntology":null},{"url":null,"slug":"roxybot-06-stochastic-prediction-and","title":"RoxyBot-06: Stochastic Prediction and Optimization in TAC Travel","date":"2014-01-16","arxiv_id":"1401.3829","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-importance","title":"Stochastic Optimization with Importance Sampling","date":"2014-01-13","arxiv_id":"1401.2753","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-complexity-particle-swarm-optimization","title":"Low-Complexity Particle Swarm Optimization for Time-Critical Applications","date":"2014-01-02","arxiv_id":"1401.0546","repositories_listed":0,"syntology":null},{"url":null,"slug":"speeding-up-convergence-via-sequential","title":"Speeding-Up Convergence via Sequential Subspace Optimization: Current State and Future Directions","date":"2013-12-31","arxiv_id":"1401.0159","repositories_listed":0,"syntology":null},{"url":null,"slug":"unit-tests-for-stochastic-optimization","title":"Unit Tests for Stochastic Optimization","date":"2013-12-20","arxiv_id":"1312.6055","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-coordinate-solvers-for-large-scale","title":"Dual coordinate solvers for large-scale structural SVMs","date":"2013-12-06","arxiv_id":"1312.1743","repositories_listed":0,"syntology":null},{"url":null,"slug":"estimation-optimization-and-parallelism-when","title":"Estimation, Optimization, and Parallelism when Data is Sparse","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"mixed-optimization-for-smooth-functions","title":"Mixed Optimization for Smooth Functions","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-robust-pca-via-stochastic-optimization","title":"Online Robust PCA via Stochastic Optimization","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-convex-optimization-with-multiple","title":"Stochastic Convex Optimization with Multiple Objectives","date":"2013-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-of-smooth-loss","title":"Stochastic Optimization of Smooth Loss","date":"2013-11-30","arxiv_id":"1312.0048","repositories_listed":0,"syntology":null},{"url":null,"slug":"fundamental-limits-of-online-and-distributed","title":"Fundamental Limits of Online and Distributed Algorithms for Statistical Learning and Estimation","date":"2013-11-14","arxiv_id":"1311.3494","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-bound-majorization","title":"Stochastic Bound Majorization","date":"2013-09-22","arxiv_id":"1309.5605","repositories_listed":0,"syntology":null},{"url":null,"slug":"strategic-planning-in-air-traffic-control-as","title":"Strategic Planning in Air Traffic Control as a Multi-objective Stochastic Optimization Problem","date":"2013-09-16","arxiv_id":"1309.3917","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-machine-learning","title":"Stochastic Optimization for Machine Learning","date":"2013-08-15","arxiv_id":"1308.3509","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixedgrad-an-o1t-convergence-rate-algorithm","title":"MixedGrad: An O(1/T) Convergence Rate Algorithm for Stochastic Smooth Optimization","date":"2013-07-26","arxiv_id":"1307.7192","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-stationary-stochastic-optimization","title":"Non-stationary Stochastic Optimization","date":"2013-07-20","arxiv_id":"1307.5449","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-of-pca-with-capped","title":"Stochastic Optimization of PCA with Capped MSG","date":"2013-07-05","arxiv_id":"1307.1674","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-state-space-approach-for-optimal-traffic","title":"A State-Space Approach for Optimal Traffic Monitoring via Network Flow Sampling","date":"2013-06-24","arxiv_id":"1306.5793","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantum-annealing-for-dirichlet-process","title":"Quantum Annealing for Dirichlet Process Mixture Models with Applications to Network Clustering","date":"2013-05-19","arxiv_id":"1305.4325","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-deterministic-logic-programs","title":"Non Deterministic Logic Programs","date":"2013-04-26","arxiv_id":"1304.7168","repositories_listed":0,"syntology":null},{"url":null,"slug":"logical-stochastic-optimization","title":"Logical Stochastic Optimization","date":"2013-04-06","arxiv_id":"1304.3489","repositories_listed":0,"syntology":null},{"url":null,"slug":"ologt-projections-for-stochastic-optimization","title":"O(logT) Projections for Stochastic Optimization of Smooth and Strongly Convex Functions","date":"2013-04-02","arxiv_id":"1304.0740","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-nonparametric-dictionary-learning","title":"Bayesian Nonparametric Dictionary Learning for Compressed Sensing MRI","date":"2013-02-12","arxiv_id":"1302.2712","repositories_listed":0,"syntology":null},{"url":null,"slug":"passive-learning-with-target-risk","title":"Passive Learning with Target Risk","date":"2013-02-08","arxiv_id":"1302.2157","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-linearly-convergent-conditional-gradient","title":"A Linearly Convergent Conditional Gradient Algorithm with Applications to Online and Stochastic Optimization","date":"2013-01-20","arxiv_id":"1301.4666","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-nonparametric-conjugate-prior-distribution","title":"A Nonparametric Conjugate Prior Distribution for the Maximizing Argument of a Noisy Function","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"ant-colony-algorithm-for-the-unsupervised","title":"Ant Colony Algorithm for the Unsupervised Word Sense Disambiguation of Texts: Comparison and Evaluation","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-sample-convergence-rates-of-zero-order","title":"Finite Sample Convergence Rates of Zero-Order Stochastic Optimization Methods","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-regularized-dual-averaging-methods","title":"Optimal Regularized Dual Averaging Methods for Stochastic Optimization","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-and-sparse","title":"Stochastic optimization and sparse statistical recovery: Optimal algorithms for high dimensions","date":"2012-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-stochastic-optimization-with-multiple","title":"Online Stochastic Optimization with Multiple Objectives","date":"2012-11-26","arxiv_id":"1211.6013","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-bayesian-inference-with","title":"Variational Bayesian Inference with Stochastic Search","date":"2012-06-27","arxiv_id":"1206.6430","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothed-functional-algorithms-for-stochastic","title":"Smoothed Functional Algorithms for Stochastic Optimization using q-Gaussian Distributions","date":"2012-06-21","arxiv_id":"1206.4832","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-delayed-stochastic-optimization","title":"Distributed Delayed Stochastic Optimization","date":"2011-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"splitting-method-for-spatio-temporal-search","title":"Splitting method for spatio-temporal search efforts planning","date":"2011-05-17","arxiv_id":"1105.3351","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonparametric-density-estimation-for","title":"Nonparametric Density Estimation for Stochastic Optimization with an Observable State Variable","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-for-latent-dirichlet","title":"Online Learning for Latent Dirichlet Allocation","date":"2010-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-reinforcement-learning-for-energy","title":"Fast Reinforcement Learning for Energy-Efficient Wireless Communications","date":"2010-09-29","arxiv_id":"1009.5773","repositories_listed":0,"syntology":null},{"url":null,"slug":"dual-averaging-for-distributed-optimization","title":"Dual Averaging for Distributed Optimization: Convergence Analysis and Network Scaling","date":"2010-05-12","arxiv_id":"1005.2012","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-submodularity-theory-and","title":"Adaptive Submodularity: Theory and Applications in Active Learning and Stochastic Optimization","date":"2010-03-21","arxiv_id":"1003.3967","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-gradient-methods-for-stochastic","title":"Accelerated Gradient Methods for Stochastic Optimization and Online Learning","date":"2009-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"4e083dedb06de782f2267324281a1985072e2c2a93f43d5dcecb32b25a4ee109","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}