{"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/11","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":11,"pages_in_order":14,"rows_per_page":100,"rows":[1001,1100],"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/10","next":"/task/stochastic-optimization/papers/12","papers":[{"url":null,"slug":"from-reinforcement-learning-to-optimal","title":"From Reinforcement Learning to Optimal Control: A unified framework for sequential decisions","date":"2019-12-07","arxiv_id":"1912.03513","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounds-for-non-convex-stochastic","title":"Lower Bounds for Non-Convex Stochastic Optimization","date":"2019-12-05","arxiv_id":"1912.02365","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-variational-bayesian-kernel","title":"Scalable Variational Bayesian Kernel Selection for Sparse Gaussian Process Regression","date":"2019-12-05","arxiv_id":"1912.02641","repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-relaxed-gradient-support-pursuit","title":"Efficient Relaxed Gradient Support Pursuit for Sparsity Constrained Non-convex Optimization","date":"2019-12-02","arxiv_id":"1912.00858","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-communication-efficient-stochastic-multi","title":"A Communication Efficient Stochastic Multi-Block Alternating Direction Method of Multipliers","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"efficient-smooth-non-convex-stochastic","title":"Efficient Smooth Non-Convex Stochastic Compositional Optimization via Stochastic Recursive Gradient Descent","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"inverse-cognitive-radar-a-revealed","title":"Identifying Cognitive Radars -- Inverse Reinforcement Learning using Revealed Preferences","date":"2019-12-01","arxiv_id":"1912.00331","repositories_listed":0,"syntology":null},{"url":null,"slug":"think-out-of-the-box-generically-constrained","title":"Think out of the \"Box\": Generically-Constrained Asynchronous Composite Optimization and Hedging","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"thinning-for-accelerating-the-learning-of","title":"Thinning for Accelerating the Learning of Point Processes","date":"2019-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"online-structured-sparsity-based-moving","title":"Online Structured Sparsity-based Moving Object Detection from Satellite Videos","date":"2019-11-29","arxiv_id":"1911.12989","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-neural-search-policies-for-classical","title":"Learning Neural Search Policies for Classical Planning","date":"2019-11-27","arxiv_id":"1911.12200","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-tensor-method-for-non-convex","title":"A Sub-sampled Tensor Method for Non-convex Optimization","date":"2019-11-23","arxiv_id":"1911.10367","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-free-locally-differentially-private","title":"Parameter-Free Locally Differentially Private Stochastic Subgradient Descent","date":"2019-11-21","arxiv_id":"1911.09564","repositories_listed":0,"syntology":null},{"url":null,"slug":"atari-fying-the-vehicle-routing-problem-with","title":"Gamifying the Vehicle Routing Problem with Stochastic Requests","date":"2019-11-14","arxiv_id":"1911.05922","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-dca-for-minimizing-a-large-sum-of","title":"Stochastic DCA for minimizing a large sum of DC functions with application to Multi-class Logistic Regression","date":"2019-11-10","arxiv_id":"1911.03992","repositories_listed":0,"syntology":null},{"url":null,"slug":"community-detection-for-power-systems-network","title":"Community Detection for Power Systems Network Aggregation Considering Renewable Variability","date":"2019-11-08","arxiv_id":"1911.04279","repositories_listed":0,"syntology":null},{"url":null,"slug":"mixing-of-stochastic-accelerated-gradient","title":"Mixing of Stochastic Accelerated Gradient Descent","date":"2019-10-31","arxiv_id":"1910.14616","repositories_listed":0,"syntology":null},{"url":null,"slug":"sparq-sgd-event-triggered-and-compressed","title":"SPARQ-SGD: Event-Triggered and Compressed Communication in Decentralized Stochastic Optimization","date":"2019-10-31","arxiv_id":"1910.14280","repositories_listed":0,"syntology":null},{"url":null,"slug":"linear-speedup-in-saddle-point-escape-for","title":"Linear Speedup in Saddle-Point Escape for Decentralized Non-Convex Optimization","date":"2019-10-30","arxiv_id":"1910.13852","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-sampling-quasi-newton-methods-for","title":"Adaptive Sampling Quasi-Newton Methods for Derivative-Free Stochastic Optimization","date":"2019-10-29","arxiv_id":"1910.13516","repositories_listed":0,"syntology":null},{"url":null,"slug":"proactive-optimization-with-unsupervised","title":"Proactive Optimization with Machine Learning: Femto-caching with Future Content Popularity","date":"2019-10-29","arxiv_id":"1910.13446","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-sparification-for-asynchronous","title":"Gradient Sparification for Asynchronous Distributed Training","date":"2019-10-24","arxiv_id":"1910.10929","repositories_listed":0,"syntology":null},{"url":null,"slug":"katyusha-acceleration-for-convex-finite-sum","title":"Katyusha Acceleration for Convex Finite-Sum Compositional Optimization","date":"2019-10-24","arxiv_id":"1910.11217","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-practicality-of-stochastic-optimization","title":"The Practicality of Stochastic Optimization in Imaging Inverse Problems","date":"2019-10-22","arxiv_id":"1910.10100","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-distributed-accelerated-stochastic","title":"Robust Distributed Accelerated Stochastic Gradient Methods for Multi-Agent Networks","date":"2019-10-19","arxiv_id":"1910.08701","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-learning-rate-selection-for-stochastic","title":"Robust Learning Rate Selection for Stochastic Optimization via Splitting Diagnostic","date":"2019-10-18","arxiv_id":"1910.08597","repositories_listed":0,"syntology":null},{"url":null,"slug":"improving-the-sample-and-communication","title":"Improving the Sample and Communication Complexity for Decentralized Non-Convex Optimization: A Joint Gradient Estimation and Tracking Approach","date":"2019-10-13","arxiv_id":"1910.05857","repositories_listed":0,"syntology":null},{"url":null,"slug":"nonconvex-stochastic-optimization-on","title":"Projection-free nonconvex stochastic optimization on Riemannian manifolds","date":"2019-10-09","arxiv_id":"1910.04194","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduced-decentralized-stochastic","title":"Variance-Reduced Decentralized Stochastic Optimization with Gradient Tracking -- Part II: GT-SVRG","date":"2019-10-08","arxiv_id":"1910.04057","repositories_listed":0,"syntology":null},{"url":null,"slug":"fis-gan-gan-with-flow-based-importance","title":"FIS-GAN: GAN with Flow-based Importance Sampling","date":"2019-10-06","arxiv_id":"1910.02519","repositories_listed":0,"syntology":null},{"url":null,"slug":"tightening-bounds-for-variational-inference","title":"Tightening Bounds for Variational Inference by Revisiting Perturbation Theory","date":"2019-09-30","arxiv_id":"1910.00069","repositories_listed":0,"syntology":null},{"url":null,"slug":"model-predictive-control-based-battery","title":"Model Predictive Control-Based Battery Scheduling and Incentives to Manipulate Demand Response Baselines","date":"2019-09-26","arxiv_id":"1909.12349","repositories_listed":0,"syntology":null},{"url":null,"slug":"-rank-scalable-multi-agent-evaluation-through","title":"$α^α$-Rank: Practically Scaling $α$-Rank through Stochastic Optimisation","date":"2019-09-25","arxiv_id":"1909.11628","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-non-asymptotic-comparison-of-svrg-and-sgd","title":"A Non-asymptotic comparison of SVRG and SGD: tradeoffs between compute and speed","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-first-order-optimization-1","title":"Accelerating First-Order Optimization Algorithms","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-anneal-and-prune-proximity-graphs","title":"Learning to Anneal and Prune Proximity Graphs for Similarity Search","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"localizing-and-amortizing-efficient-inference","title":"Localizing and Amortizing: Efficient Inference for Gaussian Processes","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"statistical-adaptive-stochastic-optimization","title":"Statistical Adaptive Stochastic Optimization","date":"2019-09-25","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"necessary-and-sufficient-conditions-for-2","title":"Geometry, Computation, and Optimality in Stochastic Optimization","date":"2019-09-23","arxiv_id":"1909.10455","repositories_listed":0,"syntology":null},{"url":null,"slug":"190909785","title":"Using Statistics to Automate Stochastic Optimization","date":"2019-09-21","arxiv_id":"1909.09785","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-opponent-modeling-via-adversarial","title":"Robust Opponent Modeling via Adversarial Ensemble Reinforcement Learning in Asymmetric Imperfect-Information Games","date":"2019-09-18","arxiv_id":"1909.08735","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributionally-robust-optimization-with","title":"Distributionally Robust Optimization with Correlated Data from Vector Autoregressive Processes","date":"2019-09-08","arxiv_id":"1909.03433","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-composite-stochastic-optimization","title":"Multi-Level Composite Stochastic Optimization via Nested Variance Reduction","date":"2019-08-29","arxiv_id":"1908.11468","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-non-convex-inf","title":"Stochastic Optimization for Non-convex Inf-Projection Problems","date":"2019-08-26","arxiv_id":"1908.09941","repositories_listed":0,"syntology":null},{"url":null,"slug":"finite-precision-stochastic-optimisation","title":"RATQ: A Universal Fixed-Length Quantizer for Stochastic Optimization","date":"2019-08-22","arxiv_id":"1908.08200","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-multi-agent-temporal-difference-learning","title":"Fast Multi-Agent Temporal-Difference Learning via Homotopy Stochastic Primal-Dual Optimization","date":"2019-08-07","arxiv_id":"1908.02805","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-flows-and-accelerated-proximal","title":"Gradient flows and proximal splitting methods: A unified view on accelerated and stochastic optimization","date":"2019-08-02","arxiv_id":"1908.00865","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-stochastic-optimization-with-the","title":"From low probability to high confidence in stochastic convex optimization","date":"2019-07-31","arxiv_id":"1907.13307","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-dynamic-multi-resource-management-in","title":"Optimal Dynamic Multi-Resource Management in Earth Observation Oriented Space Information Networks","date":"2019-07-30","arxiv_id":"1907.12717","repositories_listed":0,"syntology":null},{"url":null,"slug":"quadruply-stochastic-gradients-for-large","title":"Quadruply Stochastic Gradients for Large Scale Nonlinear Semi-Supervised AUC Optimization","date":"2019-07-29","arxiv_id":"1907.12416","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-wang-landau-algorithm-as-stochastic","title":"The Wang-Landau Algorithm as Stochastic Optimization and Its Acceleration","date":"2019-07-27","arxiv_id":"1907.11985","repositories_listed":0,"syntology":null},{"url":null,"slug":"deam-accumulated-momentum-with-discriminative","title":"DEAM: Adaptive Momentum with Discriminative Weight for Stochastic Optimization","date":"2019-07-25","arxiv_id":"1907.11307","repositories_listed":0,"syntology":null},{"url":null,"slug":"hessian-based-analysis-of-sgd-for-deep-nets","title":"Hessian based analysis of SGD for Deep Nets: Dynamics and Generalization","date":"2019-07-24","arxiv_id":"1907.10732","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-optimization-for-drone","title":"Multi-Objective Optimization for Drone Delivery","date":"2019-07-24","arxiv_id":"1908.07406","repositories_listed":0,"syntology":null},{"url":null,"slug":"re-route-package-pickup-and-delivery-planning","title":"Re-route Package Pickup and Delivery Planning with Random Demands","date":"2019-07-24","arxiv_id":"1908.07827","repositories_listed":0,"syntology":null},{"url":null,"slug":"decentralized-stochastic-first-order-methods","title":"An introduction to decentralized stochastic optimization with gradient tracking","date":"2019-07-23","arxiv_id":"1907.09648","repositories_listed":0,"syntology":null},{"url":null,"slug":"hyperlink-regression-via-bregman-divergence","title":"Hyperlink Regression via Bregman Divergence","date":"2019-07-22","arxiv_id":"1908.02573","repositories_listed":0,"syntology":null},{"url":null,"slug":"when-can-we-improve-on-sample-average","title":"When can we improve on sample average approximation for stochastic optimization?","date":"2019-07-19","arxiv_id":"1907.08334","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-hybrid-stochastic-optimization-framework","title":"A Hybrid Stochastic Optimization Framework for Stochastic Composite Nonconvex Optimization","date":"2019-07-08","arxiv_id":"1907.03793","repositories_listed":0,"syntology":null},{"url":null,"slug":"variational-inference-mpc-for-bayesian-model","title":"Variational Inference MPC for Bayesian Model-based Reinforcement Learning","date":"2019-07-08","arxiv_id":"1907.04202","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-role-of-memory-in-stochastic-optimization","title":"The Role of Memory in Stochastic Optimization","date":"2019-07-02","arxiv_id":"1907.01678","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-the-popularity-of-stochastic","title":"A Note On The Popularity of Stochastic Optimization Algorithms in Different Fields: A Quantitative Analysis from 2007 to 2017","date":"2019-06-30","arxiv_id":"1907.01453","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-network-independence-in","title":"Asymptotic Network Independence in Distributed Stochastic Optimization for Machine Learning","date":"2019-06-28","arxiv_id":"1906.12345","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-convergence-for-stochastic","title":"Optimal Convergence for Stochastic Optimization with Multiple Expectation Constraints","date":"2019-06-08","arxiv_id":"1906.03401","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-volumetric-albedo-a-surface","title":"Beyond Volumetric Albedo -- A Surface Optimization Framework for Non-Line-Of-Sight Imaging","date":"2019-06-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dont-forget-your-teacher-a-corrective","title":"Don't Forget Your Teacher: A Corrective Reinforcement Learning Framework","date":"2019-05-30","arxiv_id":"1905.13562","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-stochastic-gradient-langevin-dynamics-with-1","title":"On stochastic gradient Langevin dynamics with dependent data streams: the fully non-convex case","date":"2019-05-30","arxiv_id":"1905.13142","repositories_listed":0,"syntology":null},{"url":null,"slug":"sample-complexity-of-sample-average","title":"Sample Complexity of Sample Average Approximation for Conditional Stochastic Optimization","date":"2019-05-28","arxiv_id":"1905.11957","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-view-of-estimation-of-distribution","title":"A view of Estimation of Distribution Algorithms through the lens of Expectation-Maximization","date":"2019-05-24","arxiv_id":"1905.10474","repositories_listed":0,"syntology":null},{"url":null,"slug":"ai-cargo-a-data-driven-air-cargo-revenue","title":"AI-CARGO: A Data-Driven Air-Cargo Revenue Management System","date":"2019-05-22","arxiv_id":"1905.09130","repositories_listed":0,"syntology":null},{"url":null,"slug":"approximation-of-the-objective-insensitivity","title":"Approximation of the objective insensitivity regions using Hierarchic Memetic Strategy coupled with Covariance Matrix Adaptation Evolutionary Strategy","date":"2019-05-17","arxiv_id":"1905.07288","repositories_listed":0,"syntology":null},{"url":null,"slug":"cloud-storage-for-multi-service-battery","title":"Cloud Storage for Multi-Service Battery Operation (Extended Version)","date":"2019-05-17","arxiv_id":"1906.00732","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-stochastic-gradient-descent-algorithms","title":"Hybrid Stochastic Gradient Descent Algorithms for Stochastic Nonconvex Optimization","date":"2019-05-15","arxiv_id":"1905.05920","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-computation-and-communication","title":"On the Computation and Communication Complexity of Parallel SGD with Dynamic Batch Sizes for Stochastic Non-Convex Optimization","date":"2019-05-10","arxiv_id":"1905.04346","repositories_listed":0,"syntology":null},{"url":null,"slug":"smoothing-policies-and-safe-policy-gradients","title":"Smoothing Policies and Safe Policy Gradients","date":"2019-05-08","arxiv_id":"1905.03231","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-bayesian-variational-framework-for","title":"A Latent Variational Framework for Stochastic Optimization","date":"2019-05-05","arxiv_id":"1905.01707","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-preconditioned-accelerated-stochastic","title":"A preconditioned accelerated stochastic gradient descent algorithm","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-walk-with-sgd-how-sgd-explores-regions-of","title":"A Walk with SGD: How SGD Explores Regions of Deep Network Loss?","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-first-order-optimization","title":"Accelerating first order optimization algorithms","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"rethinking-learning-rate-schedules-for","title":"Rethinking learning rate schedules for stochastic optimization","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"signsgd-via-zeroth-order-oracle","title":"signSGD via Zeroth-Order Oracle","date":"2019-05-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"hitting-time-of-stochastic-gradient-langevin","title":"On Stationary-Point Hitting Time and Ergodicity of Stochastic Gradient Langevin Dynamics","date":"2019-04-30","arxiv_id":"1904.13016","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-adaptive-submodularity-approximation","title":"Beyond Adaptive Submodularity: Approximation Guarantees of Greedy Policy with Adaptive Submodularity Ratio","date":"2019-04-24","arxiv_id":"1904.10748","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-sequential-machine-learning","title":"Adaptive Sequential Machine Learning","date":"2019-04-04","arxiv_id":"1904.02773","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-upper-bound-for-minimum-true-matches-in","title":"An Upper Bound for Minimum True Matches in Graph Isomorphism with Simulated Annealing","date":"2019-03-29","arxiv_id":"1903.12527","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-performance-of-exact-diffusion-over","title":"On the Influence of Bias-Correction on Distributed Stochastic Optimization","date":"2019-03-26","arxiv_id":"1903.10956","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-interpretation-of-the-robustness-of","title":"Traversing the noise of dynamic mini-batch sub-sampled loss functions: A visual guide","date":"2019-03-20","arxiv_id":"1903.08552","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-stochastic-optimization-with","title":"Distributed stochastic optimization with gradient tracking over strongly-connected networks","date":"2019-03-18","arxiv_id":"1903.07266","repositories_listed":0,"syntology":null},{"url":null,"slug":"inefficiency-of-k-fac-for-large-batch-size","title":"Inefficiency of K-FAC for Large Batch Size Training","date":"2019-03-14","arxiv_id":"1903.06237","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-minibatch-stochastic-gradient-1","title":"Accelerating Minibatch Stochastic Gradient Descent using Typicality Sampling","date":"2019-03-11","arxiv_id":"1903.04192","repositories_listed":0,"syntology":null},{"url":null,"slug":"interplay-between-optimization-and","title":"An Empirical Study of Large-Batch Stochastic Gradient Descent with Structured Covariance Noise","date":"2019-02-21","arxiv_id":"1902.08234","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-conditional-gradient","title":"Stochastic Conditional Gradient++","date":"2019-02-19","arxiv_id":"1902.06992","repositories_listed":0,"syntology":null},{"url":null,"slug":"quantized-frank-wolfe-communication-efficient","title":"Quantized Frank-Wolfe: Faster Optimization, Lower Communication, and Projection Free","date":"2019-02-17","arxiv_id":"1902.06332","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-algorithms-for-the-chance","title":"Evolutionary Algorithms for the Chance-Constrained Knapsack Problem","date":"2019-02-13","arxiv_id":"1902.04767","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-complexity-of-making-the-gradient-small","title":"The Complexity of Making the Gradient Small in Stochastic Convex Optimization","date":"2019-02-13","arxiv_id":"1902.04686","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-problem-adaptive-algorithm-for-resource","title":"An adaptive stochastic optimization algorithm for resource allocation","date":"2019-02-12","arxiv_id":"1902.04376","repositories_listed":0,"syntology":null},{"url":null,"slug":"extreme-tensoring-for-low-memory","title":"Extreme Tensoring for Low-Memory Preconditioning","date":"2019-02-12","arxiv_id":"1902.04620","repositories_listed":0,"syntology":null},{"url":null,"slug":"progressive-focus-search-for-the-static-and","title":"Progressive Focus Search for the Static and Stochastic VRPTW with both Random Customers and Reveal Times","date":"2019-02-08","arxiv_id":"1902.03930","repositories_listed":0,"syntology":null},{"url":null,"slug":"distribution-dependent-analysis-of-gibbs-erm","title":"Distribution-Dependent Analysis of Gibbs-ERM Principle","date":"2019-02-05","arxiv_id":"1902.01846","repositories_listed":0,"syntology":null},{"url":null,"slug":"non-asymptotic-results-for-langevin-monte","title":"Stochastic Zeroth-order Discretizations of Langevin Diffusions for Bayesian Inference","date":"2019-02-04","arxiv_id":"1902.01373","repositories_listed":0,"syntology":null}],"record_sha256":"dddab034fa6773b67e09da96ba6e1bef569ba060d91f815c091fb192adc94486","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}