{"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/6","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":6,"pages_in_order":14,"rows_per_page":100,"rows":[501,600],"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/5","next":"/task/stochastic-optimization/papers/7","papers":[{"url":null,"slug":"variance-reduction-and-low-sample-complexity","title":"Variance Reduction and Low Sample Complexity in Stochastic Optimization via Proximal Point Method","date":"2024-02-14","arxiv_id":"2402.08992","repositories_listed":0,"syntology":null},{"url":null,"slug":"tuning-free-stochastic-optimization","title":"Tuning-Free Stochastic Optimization","date":"2024-02-12","arxiv_id":"2402.07793","repositories_listed":0,"syntology":null},{"url":null,"slug":"shadowheart-sgd-distributed-asynchronous-sgd","title":"Shadowheart SGD: Distributed Asynchronous SGD with Optimal Time Complexity Under Arbitrary Computation and Communication Heterogeneity","date":"2024-02-07","arxiv_id":"2402.04785","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-convergence-of-adam-for-stochastic","title":"On Convergence of Adam for Stochastic Optimization under Relaxed Assumptions","date":"2024-02-06","arxiv_id":"2402.03982","repositories_listed":0,"syntology":null},{"url":null,"slug":"how-free-is-parameter-free-stochastic","title":"How Free is Parameter-Free Stochastic Optimization?","date":"2024-02-05","arxiv_id":"2402.03126","repositories_listed":0,"syntology":null},{"url":null,"slug":"delivery-optimized-discovery-in-behavioral","title":"Delivery Optimized Discovery in Behavioral User Segmentation under Budget Constraint","date":"2024-02-04","arxiv_id":"2402.03388","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-stochastic-gradient-descent-a","title":"Enhancing Stochastic Gradient Descent: A Unified Framework and Novel Acceleration Methods for Faster Convergence","date":"2024-02-02","arxiv_id":"2402.01515","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-understanding-the-riemannian-sgd-and","title":"Continuous-time Riemannian SGD and SVRG Flows on Wasserstein Probabilistic Space","date":"2024-01-24","arxiv_id":"2401.13530","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-assisted-stochastic-capacity","title":"Learning-assisted Stochastic Capacity Expansion Planning: A Bayesian Optimization Approach","date":"2024-01-19","arxiv_id":"2401.10451","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerating-distributed-stochastic","title":"Accelerating Distributed Stochastic Optimization via Self-Repellent Random Walks","date":"2024-01-18","arxiv_id":"2401.09665","repositories_listed":0,"syntology":null},{"url":null,"slug":"central-limit-theorem-for-two-timescale","title":"Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications","date":"2024-01-17","arxiv_id":"2401.09339","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-confidence-level-inference-is-almost","title":"High Confidence Level Inference is Almost Free using Parallel Stochastic Optimization","date":"2024-01-17","arxiv_id":"2401.09346","repositories_listed":0,"syntology":null},{"url":null,"slug":"fairness-aware-photovoltaic-generation-limits","title":"Fairness-aware Photovoltaic Generation Limits for Voltage Regulation in Power Distribution Networks using Conservative Linear Approximations","date":"2024-01-15","arxiv_id":"2401.07404","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-estimation-of-the-inverse-of-the","title":"Online estimation of the inverse of the Hessian for stochastic optimization with application to universal stochastic Newton algorithms","date":"2024-01-15","arxiv_id":"2401.10923","repositories_listed":0,"syntology":null},{"url":null,"slug":"study-features-via-exploring-distribution","title":"Study Features via Exploring Distribution Structure","date":"2024-01-15","arxiv_id":"2401.07540","repositories_listed":0,"syntology":null},{"url":null,"slug":"spatial-aware-deep-reinforcement-learning-for","title":"Spatial-Aware Deep Reinforcement Learning for the Traveling Officer Problem","date":"2024-01-11","arxiv_id":"2401.05969","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-online-two-stage-stochastic-1","title":"Constrained Online Two-stage Stochastic Optimization: Algorithm with (and without) Predictions","date":"2024-01-02","arxiv_id":"2401.01077","repositories_listed":0,"syntology":null},{"url":null,"slug":"representation-of-forward-performance","title":"Representation of forward performance criteria with random endowment via FBSDE and application to forward optimized certainty equivalent","date":"2023-12-29","arxiv_id":"2401.00103","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-decision-dependent-games-by-learning","title":"Solving Decision-Dependent Games by Learning from Feedback","date":"2023-12-29","arxiv_id":"2312.17471","repositories_listed":0,"syntology":null},{"url":null,"slug":"semi-bandit-learning-for-monotone-stochastic","title":"Semi-Bandit Learning for Monotone Stochastic Optimization","date":"2023-12-24","arxiv_id":"2312.15427","repositories_listed":0,"syntology":null},{"url":null,"slug":"contextual-reinforcement-learning-for","title":"Contextual Reinforcement Learning for Offshore Wind Farm Bidding","date":"2023-12-18","arxiv_id":"2312.10884","repositories_listed":0,"syntology":null},{"url":null,"slug":"solving-dense-linear-systems-faster-than-via","title":"Solving Dense Linear Systems Faster Than via Preconditioning","date":"2023-12-14","arxiv_id":"2312.08893","repositories_listed":0,"syntology":null},{"url":null,"slug":"onflow-an-online-portfolio-allocation","title":"Onflow: an online portfolio allocation algorithm","date":"2023-12-08","arxiv_id":"2312.05169","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-constrained-stochastic","title":"Stochastic-Constrained Stochastic Optimization with Markovian Data","date":"2023-12-07","arxiv_id":"2312.04312","repositories_listed":0,"syntology":null},{"url":null,"slug":"alexr-optimal-single-loop-algorithms-for","title":"A Near-Optimal Single-Loop Stochastic Algorithm for Convex Finite-Sum Coupled Compositional Optimization","date":"2023-12-04","arxiv_id":"2312.02277","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-random-reshuffling-method-for-nonsmooth","title":"A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization","date":"2023-12-02","arxiv_id":"2312.01047","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparison-of-metaheuristics-for-the","title":"Comparison of metaheuristics for the firebreak placement problem: a simulation-based optimization approach","date":"2023-11-29","arxiv_id":"2311.17393","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-step-sizes-for-preconditioned","title":"Adaptive Step Sizes for Preconditioned Stochastic Gradient Descent","date":"2023-11-28","arxiv_id":"2311.16956","repositories_listed":0,"syntology":null},{"url":null,"slug":"applying-statistical-learning-theory-to-deep","title":"Applying statistical learning theory to deep learning","date":"2023-11-26","arxiv_id":"2311.15404","repositories_listed":0,"syntology":null},{"url":null,"slug":"low-complexity-joint-beamforming-for-ris-1","title":"Low-Complexity Joint Beamforming for RIS-Assisted MU-MISO Systems Based on Model-Driven Deep Learning","date":"2023-11-26","arxiv_id":"2311.15313","repositories_listed":0,"syntology":null},{"url":null,"slug":"locally-optimal-descent-for-dynamic-stepsize","title":"Locally Optimal Descent for Dynamic Stepsize Scheduling","date":"2023-11-23","arxiv_id":"2311.13877","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-shells-for-efficient-neural-radiance","title":"Adaptive Shells for Efficient Neural Radiance Field Rendering","date":"2023-11-16","arxiv_id":"2311.10091","repositories_listed":0,"syntology":null},{"url":null,"slug":"outliers-with-opposing-signals-have-an","title":"Outliers with Opposing Signals Have an Outsized Effect on Neural Network Optimization","date":"2023-11-07","arxiv_id":"2311.04163","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-learning-quantum-states-with-the","title":"Online Learning Quantum States with the Logarithmic Loss via VB-FTRL","date":"2023-11-06","arxiv_id":"2311.04237","repositories_listed":0,"syntology":null},{"url":null,"slug":"safe-collective-control-under-noisy-inputs","title":"Safe Collective Control under Noisy Inputs and Competing Constraints via Non-Smooth Barrier Functions","date":"2023-11-06","arxiv_id":"2311.03284","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-stochastic-optimization-methods","title":"Riemannian stochastic optimization methods avoid strict saddle points","date":"2023-11-04","arxiv_id":"2311.02374","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-coreset-based-tempered-variational","title":"A Coreset-based, Tempered Variational Posterior for Accurate and Scalable Stochastic Gaussian Process Inference","date":"2023-11-02","arxiv_id":"2311.01409","repositories_listed":0,"syntology":null},{"url":null,"slug":"evolutionary-pareto-set-learning-with","title":"Dealing with Structure Constraints in Evolutionary Pareto Set Learning","date":"2023-10-31","arxiv_id":"2310.20426","repositories_listed":0,"syntology":null},{"url":null,"slug":"rom-based-stochastic-optimization-for-a","title":"ROM-Based Stochastic Optimization for a Continuous Manufacturing Process","date":"2023-10-24","arxiv_id":"2310.16144","repositories_listed":0,"syntology":null},{"url":null,"slug":"sensor-attacks-and-resilient-defense-on-hvac","title":"Sensor Attacks and Resilient Defense on HVAC Systems for Energy Market Signal Tracking","date":"2023-10-24","arxiv_id":"2310.15413","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimal-transport-based-nonlinear-filtering","title":"Nonlinear Filtering with Brenier Optimal Transport Maps","date":"2023-10-21","arxiv_id":"2310.13886","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-distributed-stochastic","title":"Differentially Private Distributed Stochastic Optimization with Time-Varying Sample Sizes","date":"2023-10-18","arxiv_id":"2310.11892","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-for-non-convex","title":"Stochastic Optimization for Non-convex Problem with Inexact Hessian Matrix, Gradient, and Function","date":"2023-10-18","arxiv_id":"2310.11866","repositories_listed":0,"syntology":null},{"url":null,"slug":"resampling-stochastic-gradient-descent","title":"Resampling Stochastic Gradient Descent Cheaply for Efficient Uncertainty Quantification","date":"2023-10-17","arxiv_id":"2310.11065","repositories_listed":0,"syntology":null},{"url":null,"slug":"eco-driving-control-of-connected-and","title":"Eco-Driving Control of Connected and Automated Vehicles using Neural Network based Rollout","date":"2023-10-16","arxiv_id":"2310.10878","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-non-convex-learning","title":"Differentially Private Non-convex Learning for Multi-layer Neural Networks","date":"2023-10-12","arxiv_id":"2310.08425","repositories_listed":0,"syntology":null},{"url":null,"slug":"randcom-random-communication-skipping-method","title":"Achieving Linear Speedup with ProxSkip in Distributed Stochastic Optimization","date":"2023-10-12","arxiv_id":"2310.07983","repositories_listed":0,"syntology":null},{"url":null,"slug":"federated-conditional-stochastic-optimization","title":"Federated Conditional Stochastic Optimization","date":"2023-10-04","arxiv_id":"2310.02524","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-nonparametric-hypothesis-testing-to","title":"Robust Nonparametric Hypothesis Testing to Understand Variability in Training Neural Networks","date":"2023-10-01","arxiv_id":"2310.00541","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-stochastic-optimization-via-gradient","title":"Robust Stochastic Optimization via Gradient Quantile Clipping","date":"2023-09-29","arxiv_id":"2309.17316","repositories_listed":0,"syntology":null},{"url":null,"slug":"markov-chain-mirror-descent-on-data","title":"Markov Chain Mirror Descent On Data Federation","date":"2023-09-26","arxiv_id":"2309.14775","repositories_listed":0,"syntology":null},{"url":null,"slug":"zeroth-order-riemannian-averaging-stochastic","title":"Zeroth-order Riemannian Averaging Stochastic Approximation Algorithms","date":"2023-09-25","arxiv_id":"2309.14506","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributionally-time-varying-online","title":"Distributionally Time-Varying Online Stochastic Optimization under Polyak-Łojasiewicz Condition with Application in Conditional Value-at-Risk Statistical Learning","date":"2023-09-18","arxiv_id":"2309.09411","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-online-forecast-and-optimize","title":"A Stochastic Online Forecast-and-Optimize Framework for Real-Time Energy Dispatch in Virtual Power Plants under Uncertainty","date":"2023-09-15","arxiv_id":"2309.08642","repositories_listed":0,"syntology":null},{"url":null,"slug":"kernel-based-stochastic-learning-of-large","title":"Stochastic Learning of Semiparametric Monotone Index Models with Large Sample Size","date":"2023-09-13","arxiv_id":"2309.06693","repositories_listed":0,"syntology":null},{"url":null,"slug":"backward-error-analysis-and-the-qualitative","title":"Backward error analysis and the qualitative behaviour of stochastic optimization algorithms: Application to stochastic coordinate descent","date":"2023-09-05","arxiv_id":"2309.02082","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-unified-analysis-for-the-subgradient","title":"A Unified Analysis on the Subgradient Upper Bounds for the Subgradient Methods Minimizing Composite Nonconvex, Nonsmooth and Non-Lipschitz Functions","date":"2023-08-30","arxiv_id":"2308.16362","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-homogenization-approach-for-gradient","title":"A Homogenization Approach for Gradient-Dominated Stochastic Optimization","date":"2023-08-21","arxiv_id":"2308.10630","repositories_listed":0,"syntology":null},{"url":null,"slug":"resource-adaptive-newton-s-method-for","title":"Adaptive pruning-based Newton's method for distributed learning","date":"2023-08-20","arxiv_id":"2308.10154","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-of-coupled-power","title":"Stochastic Optimization of Coupled Power Distribution-Urban Transportation Network Operations with Autonomous Mobility on Demand Systems","date":"2023-08-20","arxiv_id":"2308.10181","repositories_listed":0,"syntology":null},{"url":null,"slug":"breaking-the-complexity-barrier-in","title":"Faster Stochastic Variance Reduction Methods for Compositional MiniMax Optimization","date":"2023-08-18","arxiv_id":"2308.09604","repositories_listed":0,"syntology":null},{"url":null,"slug":"path-convergence-of-markov-chains-on-large","title":"Path convergence of Markov chains on large graphs","date":"2023-08-18","arxiv_id":"2308.09214","repositories_listed":0,"syntology":null},{"url":null,"slug":"byzantine-robust-decentralized-stochastic-1","title":"Byzantine-Robust Decentralized Stochastic Optimization with Stochastic Gradient Noise-Independent Learning Error","date":"2023-08-10","arxiv_id":"2308.05292","repositories_listed":0,"syntology":null},{"url":null,"slug":"accurate-neural-network-pruning-requires","title":"Accurate Neural Network Pruning Requires Rethinking Sparse Optimization","date":"2023-08-03","arxiv_id":"2308.02060","repositories_listed":0,"syntology":null},{"url":null,"slug":"proactive-resource-request-for-disaster","title":"Proactive Resource Request for Disaster Response: A Deep Learning-based Optimization Model","date":"2023-07-31","arxiv_id":"2307.16661","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-flight-plan-optimization","title":"Stochastic Flight Plan Optimization","date":"2023-07-27","arxiv_id":"2307.14883","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-marginal-value-of-momentum-for-small","title":"The Marginal Value of Momentum for Small Learning Rate SGD","date":"2023-07-27","arxiv_id":"2307.15196","repositories_listed":0,"syntology":null},{"url":null,"slug":"high-probability-analysis-for-non-convex","title":"High Probability Analysis for Non-Convex Stochastic Optimization with Clipping","date":"2023-07-25","arxiv_id":"2307.13680","repositories_listed":0,"syntology":null},{"url":null,"slug":"ml-bfgs-a-momentum-based-l-bfgs-for","title":"mL-BFGS: A Momentum-based L-BFGS for Distributed Large-Scale Neural Network Optimization","date":"2023-07-25","arxiv_id":"2307.13744","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-adam-for-non-convex-objectives","title":"Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case","date":"2023-07-20","arxiv_id":"2307.11782","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-accelerating-benders-decomposition","title":"Accelerating Cutting-Plane Algorithms via Reinforcement Learning Surrogates","date":"2023-07-17","arxiv_id":"2307.08816","repositories_listed":0,"syntology":null},{"url":null,"slug":"min-max-optimization-under-delays","title":"Min-Max Optimization under Delays","date":"2023-07-13","arxiv_id":"2307.06886","repositories_listed":0,"syntology":null},{"url":null,"slug":"score-function-gradient-estimation-to-widen","title":"Score Function Gradient Estimation to Widen the Applicability of Decision-Focused Learning","date":"2023-07-11","arxiv_id":"2307.05213","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-algorithm-with-optimal-dimension","title":"An Algorithm with Optimal Dimension-Dependence for Zero-Order Nonsmooth Nonconvex Stochastic Optimization","date":"2023-07-10","arxiv_id":"2307.04504","repositories_listed":0,"syntology":null},{"url":null,"slug":"importance-sampling-for-minimization-of-tail","title":"Importance Sampling for Minimization of Tail Risks: A Tutorial","date":"2023-07-10","arxiv_id":"2307.04676","repositories_listed":0,"syntology":null},{"url":null,"slug":"scenario-based-cost-optimization-of-water","title":"Scenario Based Cost Optimization of Water Distribution Networks Powered by Grid-Connected Photovoltaic Systems","date":"2023-07-03","arxiv_id":"2307.00845","repositories_listed":0,"syntology":null},{"url":null,"slug":"uncertainty-informed-optimal-resource","title":"Uncertainty Informed Optimal Resource Allocation with Gaussian Process based Bayesian Inference","date":"2023-06-30","arxiv_id":"2307.00032","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-strategies-in-non-convex","title":"Adaptive Strategies in Non-convex Optimization","date":"2023-06-17","arxiv_id":"2306.10278","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-computation-communication-trade-off","title":"On the Computation-Communication Trade-Off with A Flexible Gradient Tracking Approach","date":"2023-06-12","arxiv_id":"2306.07159","repositories_listed":0,"syntology":null},{"url":null,"slug":"buying-information-for-stochastic","title":"Buying Information for Stochastic Optimization","date":"2023-06-06","arxiv_id":"2306.03607","repositories_listed":0,"syntology":null},{"url":null,"slug":"branching-model-with-state-dependent","title":"Branching model with state dependent offspring distribution for Chlamydia spread","date":"2023-06-05","arxiv_id":"2306.02893","repositories_listed":0,"syntology":null},{"url":null,"slug":"prescriptive-pca-dimensionality-reduction-for","title":"Prescriptive PCA: Dimensionality Reduction for Two-stage Stochastic Optimization","date":"2023-06-04","arxiv_id":"2306.02223","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-convergence-guarantees-for-black-box","title":"Provable convergence guarantees for black-box variational inference","date":"2023-06-04","arxiv_id":"2306.03638","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-free-projected-gradient-descent","title":"Parameter-free projected gradient descent","date":"2023-05-31","arxiv_id":"2305.19605","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-model-predictive-control-with-1","title":"Stochastic Model Predictive Control with Dynamic Chance Constraints","date":"2023-05-30","arxiv_id":"2305.19262","repositories_listed":0,"syntology":null},{"url":null,"slug":"first-order-methods-with-markovian-noise-from","title":"First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities","date":"2023-05-25","arxiv_id":"2305.15938","repositories_listed":0,"syntology":null},{"url":null,"slug":"momentum-provably-improves-error-feedback","title":"Momentum Provably Improves Error Feedback!","date":"2023-05-24","arxiv_id":"2305.15155","repositories_listed":0,"syntology":null},{"url":null,"slug":"offline-primal-dual-reinforcement-learning","title":"Offline Primal-Dual Reinforcement Learning for Linear MDPs","date":"2023-05-22","arxiv_id":"2305.12944","repositories_listed":0,"syntology":null},{"url":null,"slug":"uniform-in-time-wasserstein-stability-bounds","title":"Uniform-in-Time Wasserstein Stability Bounds for (Noisy) Stochastic Gradient Descent","date":"2023-05-20","arxiv_id":"2305.12056","repositories_listed":0,"syntology":null},{"url":null,"slug":"constrained-environment-optimization-for","title":"Constrained Environment Optimization for Prioritized Multi-Agent Navigation","date":"2023-05-18","arxiv_id":"2305.11260","repositories_listed":0,"syntology":null},{"url":null,"slug":"lyapunov-driven-deep-reinforcement-learning","title":"Lyapunov-Driven Deep Reinforcement Learning for Edge Inference Empowered by Reconfigurable Intelligent Surfaces","date":"2023-05-18","arxiv_id":"2305.10931","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-understanding-the-generalization-of-1","title":"Towards Understanding the Generalization of Graph Neural Networks","date":"2023-05-14","arxiv_id":"2305.08048","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bounds-and-accelerated-algorithms-in","title":"Lower Bounds and Accelerated Algorithms in Distributed Stochastic Optimization with Communication Compression","date":"2023-05-12","arxiv_id":"2305.07612","repositories_listed":0,"syntology":null},{"url":null,"slug":"assessment-of-reinforcement-learning","title":"Assessment of Reinforcement Learning Algorithms for Nuclear Power Plant Fuel Optimization","date":"2023-05-09","arxiv_id":"2305.05812","repositories_listed":0,"syntology":null},{"url":null,"slug":"uadam-unified-adam-type-algorithmic-framework","title":"UAdam: Unified Adam-Type Algorithmic Framework for Non-Convex Stochastic Optimization","date":"2023-05-09","arxiv_id":"2305.05675","repositories_listed":0,"syntology":null},{"url":null,"slug":"projection-free-online-convex-optimization","title":"Projection-Free Online Convex Optimization with Stochastic Constraints","date":"2023-05-02","arxiv_id":"2305.01333","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-mpc-for-energy-hubs-using-data","title":"Stochastic MPC for energy hubs using data driven demand forecasting","date":"2023-04-24","arxiv_id":"2304.12438","repositories_listed":0,"syntology":null},{"url":null,"slug":"near-optimal-decentralized-momentum-method","title":"Near-Optimal Decentralized Momentum Method for Nonconvex-PL Minimax Problems","date":"2023-04-21","arxiv_id":"2304.10902","repositories_listed":0,"syntology":null},{"url":null,"slug":"debiasing-conditional-stochastic-optimization","title":"Debiasing Conditional Stochastic Optimization","date":"2023-04-20","arxiv_id":"2304.10613","repositories_listed":0,"syntology":null},{"url":null,"slug":"mac-a-novel-stochastic-optimization-method","title":"MAC, a novel stochastic optimization method","date":"2023-04-14","arxiv_id":"2304.12248","repositories_listed":0,"syntology":null}],"record_sha256":"675f89ff38ddf50003e74a3e438e3ed324da2d25647cf52456a38d6e86c267b1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}