{"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/5","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":5,"pages_in_order":14,"rows_per_page":100,"rows":[401,500],"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/4","next":"/task/stochastic-optimization/papers/6","papers":[{"url":null,"slug":"convergence-rate-analysis-of-lion","title":"Convergence Rate Analysis of LION","date":"2024-11-12","arxiv_id":"2411.07724","repositories_listed":0,"syntology":null},{"url":null,"slug":"movable-antenna-aided-federated-learning-with","title":"Movable Antenna-Aided Federated Learning with Over-the-Air Aggregation: Joint Optimization of Positioning, Beamforming, and User Selection","date":"2024-11-11","arxiv_id":"2411.06721","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-stochastic-optimization-for-low","title":"Two-Stage Stochastic Optimization for Low-Carbon Dispatch in a Combined Energy System","date":"2024-11-11","arxiv_id":"2411.07069","repositories_listed":0,"syntology":null},{"url":null,"slug":"asymptotic-regularity-of-a-generalised","title":"Asymptotic regularity of a generalised stochastic Halpern scheme with applications","date":"2024-11-07","arxiv_id":"2411.04845","repositories_listed":0,"syntology":null},{"url":null,"slug":"memory-driven-metaheuristics-improving","title":"Memory-Driven Metaheuristics: Improving Optimization Performance","date":"2024-11-07","arxiv_id":"2411.15151","repositories_listed":0,"syntology":null},{"url":null,"slug":"forecasting-outside-the-box-application","title":"Forecasting Outside the Box: Application-Driven Optimal Pointwise Forecasts for Stochastic Optimization","date":"2024-11-05","arxiv_id":"2411.03520","repositories_listed":0,"syntology":null},{"url":null,"slug":"mess-energy-optimal-inferencing-in-language","title":"MESS+: Energy-Optimal Inferencing in Language Model Zoos with Service Level Guarantees","date":"2024-10-31","arxiv_id":"2411.00889","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-reliable-alignment-uncertainty-aware","title":"Towards Reliable Alignment: Uncertainty-aware RLHF","date":"2024-10-31","arxiv_id":"2410.23726","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-matching-with-post-allocation-service","title":"Dynamic Matching with Post-allocation Service and its Application to Refugee Resettlement","date":"2024-10-30","arxiv_id":"2410.22992","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-approximation-with-unbounded","title":"Stochastic Approximation with Unbounded Markovian Noise: A General-Purpose Theorem","date":"2024-10-29","arxiv_id":"2410.21704","repositories_listed":0,"syntology":null},{"url":null,"slug":"survival-models-proper-scoring-rule-and","title":"Survival Models: Proper Scoring Rule and Stochastic Optimization with Competing Risks","date":"2024-10-22","arxiv_id":"2410.16765","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-quantitative-robbins-siegmund-theorem","title":"A quantitative Robbins-Siegmund theorem","date":"2024-10-21","arxiv_id":"2410.15986","repositories_listed":0,"syntology":null},{"url":null,"slug":"from-gradient-clipping-to-normalization-for","title":"From Gradient Clipping to Normalization for Heavy Tailed SGD","date":"2024-10-17","arxiv_id":"2410.13849","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-approach-to-bi-level","title":"A Stochastic Approach to Bi-Level Optimization for Hyperparameter Optimization and Meta Learning","date":"2024-10-14","arxiv_id":"2410.10417","repositories_listed":0,"syntology":null},{"url":null,"slug":"mindflayer-efficient-asynchronous-parallel","title":"MindFlayer SGD: Efficient Parallel SGD in the Presence of Heterogeneous and Random Worker Compute Times","date":"2024-10-05","arxiv_id":"2410.04285","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-the-saga-algorithm-with-decreasing-step","title":"On the SAGA algorithm with decreasing step","date":"2024-10-02","arxiv_id":"2410.03760","repositories_listed":0,"syntology":null},{"url":null,"slug":"spacemesh-a-continuous-representation-for","title":"SpaceMesh: A Continuous Representation for Learning Manifold Surface Meshes","date":"2024-09-30","arxiv_id":"2409.20562","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-client-scheduling-and-resource","title":"Online Client Scheduling and Resource Allocation for Efficient Federated Edge Learning","date":"2024-09-29","arxiv_id":"2410.10833","repositories_listed":0,"syntology":null},{"url":null,"slug":"trust-region-sequential-quadratic-programming","title":"Trust-Region Sequential Quadratic Programming for Stochastic Optimization with Random Models","date":"2024-09-24","arxiv_id":"2409.15734","repositories_listed":0,"syntology":null},{"url":null,"slug":"on-broad-beam-reflection-for-dual-polarized","title":"On Broad-Beam Reflection for Dual-Polarized RIS-Assisted MIMO Systems","date":"2024-09-21","arxiv_id":"2410.07134","repositories_listed":0,"syntology":null},{"url":null,"slug":"splitvaes-decentralized-scenario-generation","title":"SplitVAEs: Decentralized scenario generation from siloed data for stochastic optimization problems","date":"2024-09-18","arxiv_id":"2409.12328","repositories_listed":0,"syntology":null},{"url":null,"slug":"variance-reduced-first-order-methods-for","title":"Variance-reduced first-order methods for deterministically constrained stochastic nonconvex optimization with strong convergence guarantees","date":"2024-09-16","arxiv_id":"2409.09906","repositories_listed":0,"syntology":null},{"url":null,"slug":"cross-entropy-optimization-for-hyperparameter","title":"Cross-Entropy Optimization for Hyperparameter Optimization in Stochastic Gradient-based Approaches to Train Deep Neural Networks","date":"2024-09-14","arxiv_id":"2409.09240","repositories_listed":0,"syntology":null},{"url":null,"slug":"notes-on-sampled-gaussian-mechanism","title":"Notes on Sampled Gaussian Mechanism","date":"2024-09-06","arxiv_id":"2409.04636","repositories_listed":0,"syntology":null},{"url":null,"slug":"evaluation-of-prosumer-networks-for-peak-load","title":"Evaluation of Prosumer Networks for Peak Load Management in Iran: A Distributed Contextual Stochastic Optimization Approach","date":"2024-08-31","arxiv_id":"2409.00493","repositories_listed":0,"syntology":null},{"url":null,"slug":"bayesian-optimization-for-non-convex-two","title":"Bayesian Optimization for Non-Convex Two-Stage Stochastic Optimization Problems","date":"2024-08-30","arxiv_id":"2408.17387","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-level-monte-carlo-gradient-methods-for","title":"Multi-level Monte-Carlo Gradient Methods for Stochastic Optimization with Biased Oracles","date":"2024-08-20","arxiv_id":"2408.11084","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-private-stochastic-optimization","title":"Differential Private Stochastic Optimization with Heavy-tailed Data: Towards Optimal Rates","date":"2024-08-19","arxiv_id":"2408.09891","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-adaptive-decentralized-learning","title":"Faster Adaptive Decentralized Learning Algorithms","date":"2024-08-19","arxiv_id":"2408.09775","repositories_listed":0,"syntology":null},{"url":null,"slug":"gradient-variation-online-learning-under","title":"Gradient-Variation Online Learning under Generalized Smoothness","date":"2024-08-17","arxiv_id":"2408.09074","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-limitations-of-model-retraining-in-the","title":"The Limitations of Model Retraining in the Face of Performativity","date":"2024-08-16","arxiv_id":"2408.08499","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-real-time-economic-dispatch-for","title":"Stochastic Real-Time Economic Dispatch for Integrated Electric and Gas Systems Considering Uncertainty Propagation and Pipeline Leakage","date":"2024-08-15","arxiv_id":"2408.08101","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-stochastic-optimization-with-arbitrary","title":"Faster Stochastic Optimization with Arbitrary Delays via Asynchronous Mini-Batching","date":"2024-08-14","arxiv_id":"2408.07503","repositories_listed":0,"syntology":null},{"url":null,"slug":"portfolio-and-reinsurance-optimization-under","title":"Portfolio and reinsurance optimization under unknown market price of risk","date":"2024-08-14","arxiv_id":"2408.07432","repositories_listed":0,"syntology":null},{"url":null,"slug":"2407-21078","title":"Convergence rates for the Adam optimizer","date":"2024-07-29","arxiv_id":"2407.21078","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adaptive-gradient-regularization-method","title":"Adaptive Gradient Regularization: A Faster and Generalizable Optimization Technique for Deep Neural Networks","date":"2024-07-24","arxiv_id":"2407.16944","repositories_listed":0,"syntology":null},{"url":null,"slug":"generalization-bounds-of-surrogate-policies","title":"Generalization Bounds of Surrogate Policies for Combinatorial Optimization Problems","date":"2024-07-24","arxiv_id":"2407.17200","repositories_listed":0,"syntology":null},{"url":null,"slug":"data-driven-estimation-of-conditional","title":"Data-Driven Estimation of Conditional Expectations, Application to Optimal Stopping and Reinforcement Learning","date":"2024-07-18","arxiv_id":"2407.13189","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-and-federated-stochastic-convex","title":"Private and Federated Stochastic Convex Optimization: Efficient Strategies for Centralized Systems","date":"2024-07-17","arxiv_id":"2407.12396","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-stochastic-optimization-for","title":"Enhancing Stochastic Optimization for Statistical Efficiency Using ROOT-SGD with Diminishing Stepsize","date":"2024-07-15","arxiv_id":"2407.10955","repositories_listed":0,"syntology":null},{"url":null,"slug":"topological-generalization-bounds-for","title":"Topological Generalization Bounds for Discrete-Time Stochastic Optimization Algorithms","date":"2024-07-11","arxiv_id":"2407.08723","repositories_listed":0,"syntology":null},{"url":null,"slug":"uav-formation-and-resource-allocation","title":"UAV Formation and Resource Allocation Optimization for Communication-Assisted 3D InSAR Sensing","date":"2024-07-09","arxiv_id":"2407.06607","repositories_listed":0,"syntology":null},{"url":"/paper/congo-compressive-online-gradient","slug":"congo-compressive-online-gradient","title":"CONGO: Compressive Online Gradient Optimization","date":"2024-07-08","arxiv_id":"2407.06325","repositories_listed":0,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/congo-compressive-online-gradient#ran","syntology_url":"https://syntology.ai/paper/2407.06325","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2407.06325"}},"official":null}},{"url":null,"slug":"stability-and-generalization-for-stochastic","title":"Stability and Generalization for Stochastic Recursive Momentum-based Algorithms for (Strongly-)Convex One to $K$-Level Stochastic Optimizations","date":"2024-07-07","arxiv_id":"2407.05286","repositories_listed":0,"syntology":null},{"url":null,"slug":"private-zeroth-order-nonsmooth-nonconvex","title":"Private Zeroth-Order Nonsmooth Nonconvex Optimization","date":"2024-06-27","arxiv_id":"2406.19579","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-first-order-methods-with-non","title":"Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization","date":"2024-06-27","arxiv_id":"2406.19475","repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-scheduling-for-vehicle-to-vehicle","title":"Dynamic Scheduling for Vehicle-to-Vehicle Communications Enhanced Federated Learning","date":"2024-06-25","arxiv_id":"2406.17470","repositories_listed":0,"syntology":null},{"url":null,"slug":"effect-of-random-learning-rate-theoretical","title":"Effect of Random Learning Rate: Theoretical Analysis of SGD Dynamics in Non-Convex Optimization via Stationary Distribution","date":"2024-06-23","arxiv_id":"2406.16032","repositories_listed":0,"syntology":null},{"url":null,"slug":"teaching-models-to-survive-proper-scoring","title":"Teaching Models To Survive: Proper Scoring Rule and Stochastic Optimization with Competing Risks","date":"2024-06-20","arxiv_id":"2406.14085","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-rates-for-bandit-pac-multiclass","title":"Fast Rates for Bandit PAC Multiclass Classification","date":"2024-06-18","arxiv_id":"2406.12406","repositories_listed":0,"syntology":null},{"url":null,"slug":"scalable-differentiable-causal-discovery-in","title":"Scalable Differentiable Causal Discovery in the Presence of Latent Confounders with Skeleton Posterior (Extended Version)","date":"2024-06-15","arxiv_id":"2406.10537","repositories_listed":0,"syntology":null},{"url":null,"slug":"faster-convergence-on-heterogeneous-federated","title":"Faster Convergence on Heterogeneous Federated Edge Learning: An Adaptive Clustered Data Sharing Approach","date":"2024-06-14","arxiv_id":"2406.09776","repositories_listed":0,"syntology":null},{"url":null,"slug":"measuring-model-variability-using-robust-non","title":"Measuring training variability from stochastic optimization using robust nonparametric testing","date":"2024-06-12","arxiv_id":"2406.08307","repositories_listed":0,"syntology":null},{"url":null,"slug":"loss-gradient-gaussian-width-based","title":"Loss Gradient Gaussian Width based Generalization and Optimization Guarantees","date":"2024-06-11","arxiv_id":"2406.07712","repositories_listed":0,"syntology":null},{"url":null,"slug":"robust-distribution-learning-with-local-and","title":"Robust Distribution Learning with Local and Global Adversarial Corruptions","date":"2024-06-10","arxiv_id":"2406.06509","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-version-of-chung-s-lemma-and","title":"A Generalized Version of Chung's Lemma and its Applications","date":"2024-06-09","arxiv_id":"2406.05637","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-only-accept-samples-once-fast-self","title":"You Only Accept Samples Once: Fast, Self-Correcting Stochastic Variational Inference","date":"2024-06-05","arxiv_id":"2406.02838","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-variance-reduction-for-stochastic","title":"Adaptive Variance Reduction for Stochastic Optimization under Weaker Assumptions","date":"2024-06-04","arxiv_id":"2406.01959","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-optimization-perspective-on-first","title":"Online Optimization Perspective on First-Order and Zero-Order Decentralized Nonsmooth Nonconvex Stochastic Optimization","date":"2024-06-03","arxiv_id":"2406.01484","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-ranking-scheme-for-the-performance","title":"A Novel Ranking Scheme for the Performance Analysis of Stochastic Optimization Algorithms using the Principles of Severity","date":"2024-05-31","arxiv_id":"2406.00154","repositories_listed":0,"syntology":null},{"url":null,"slug":"deep-learning-for-computing-convergence-rates","title":"Deep Learning for Computing Convergence Rates of Markov Chains","date":"2024-05-30","arxiv_id":"2405.20435","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-algorithms-for-1","title":"Stochastic Optimization Algorithms for Instrumental Variable Regression with Streaming Data","date":"2024-05-29","arxiv_id":"2405.19463","repositories_listed":0,"syntology":null},{"url":null,"slug":"trustworthy-dnn-partition-for-blockchain","title":"Trustworthy DNN Partition for Blockchain-enabled Digital Twin in Wireless IIoT Networks","date":"2024-05-28","arxiv_id":"2405.17914","repositories_listed":0,"syntology":null},{"url":null,"slug":"convergence-of-sgd-with-momentum-in-the","title":"Convergence of SGD with momentum in the nonconvex case: A time window-based analysis","date":"2024-05-27","arxiv_id":"2405.16954","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-with-user-level-local-differential","title":"Learning with User-Level Local Differential Privacy","date":"2024-05-27","arxiv_id":"2405.17079","repositories_listed":0,"syntology":null},{"url":null,"slug":"geoadaler-geometric-insights-into-adaptive","title":"GeoAdaLer: Geometric Insights into Adaptive Stochastic Gradient Descent Algorithms","date":"2024-05-25","arxiv_id":"2405.16255","repositories_listed":0,"syntology":null},{"url":null,"slug":"derivatives-of-stochastic-gradient-descent","title":"Derivatives of Stochastic Gradient Descent in parametric optimization","date":"2024-05-24","arxiv_id":"2405.15894","repositories_listed":0,"syntology":null},{"url":null,"slug":"lower-bound-on-the-greedy-approximation-ratio","title":"Lower Bound on the Greedy Approximation Ratio for Adaptive Submodular Cover","date":"2024-05-23","arxiv_id":"2405.14995","repositories_listed":0,"syntology":null},{"url":null,"slug":"two-stage-ml-guided-decision-rules-for","title":"Efficiently Training Deep-Learning Parametric Policies using Lagrangian Duality","date":"2024-05-23","arxiv_id":"2405.14973","repositories_listed":0,"syntology":null},{"url":null,"slug":"riemannian-bilevel-optimization-1","title":"Riemannian Bilevel Optimization","date":"2024-05-22","arxiv_id":"2405.15816","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-functional-model-method-for-nonconvex","title":"A Functional Model Method for Nonconvex Nonsmooth Conditional Stochastic Optimization","date":"2024-05-17","arxiv_id":"2405.10815","repositories_listed":0,"syntology":null},{"url":null,"slug":"asynchronous-federated-stochastic","title":"Asynchronous Federated Stochastic Optimization for Heterogeneous Objectives Under Arbitrary Delays","date":"2024-05-16","arxiv_id":"2405.10123","repositories_listed":0,"syntology":null},{"url":null,"slug":"subgradient-convergence-implies","title":"Subgradient Selection Convergence Implies Uniform Subdifferential Set Convergence: And Other Tight Convergences Rates in Stochastic Convex Composite Minimization","date":"2024-05-16","arxiv_id":"2405.10289","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-stochastic-policy-gradient-negative","title":"Fast Stochastic Policy Gradient: Negative Momentum for Reinforcement Learning","date":"2024-05-08","arxiv_id":"2405.12228","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-full-adagrad-algorithm-with-o-nd-operations","title":"A Full Adagrad algorithm with O(Nd) operations","date":"2024-05-03","arxiv_id":"2405.01908","repositories_listed":0,"syntology":null},{"url":null,"slug":"distributed-stochastic-optimization-of-a","title":"Distributed Stochastic Optimization of a Neural Representation Network for Time-Space Tomography Reconstruction","date":"2024-04-29","arxiv_id":"2404.19075","repositories_listed":0,"syntology":null},{"url":null,"slug":"research-on-opf-control-of-three-phase-four","title":"Research on OPF control of three-phase four-wire low-voltage distribution network considering uncertainty","date":"2024-04-24","arxiv_id":"2404.15584","repositories_listed":0,"syntology":null},{"url":null,"slug":"advancing-forest-fire-prevention-deep","title":"Advancing Forest Fire Prevention: Deep Reinforcement Learning for Effective Firebreak Placement","date":"2024-04-12","arxiv_id":"2404.08523","repositories_listed":0,"syntology":null},{"url":null,"slug":"decision-transformer-for-wireless","title":"Decision Transformers for Wireless Communications: A New Paradigm of Resource Management","date":"2024-04-08","arxiv_id":"2404.05199","repositories_listed":0,"syntology":null},{"url":null,"slug":"transformer-based-stagewise-decomposition-for","title":"Transformer-based Stagewise Decomposition for Large-Scale Multistage Stochastic Optimization","date":"2024-04-03","arxiv_id":"2404.02583","repositories_listed":0,"syntology":null},{"url":null,"slug":"accelerated-parameter-free-stochastic","title":"Accelerated Parameter-Free Stochastic Optimization","date":"2024-03-31","arxiv_id":"2404.00666","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-suspension-a-two-phase-methodology-for","title":"Beyond Suspension: A Two-phase Methodology for Concluding Sports Leagues","date":"2024-03-29","arxiv_id":"2404.00178","repositories_listed":0,"syntology":null},{"url":null,"slug":"taming-the-interactive-particle-langevin","title":"Taming the Interacting Particle Langevin Algorithm: The Superlinear case","date":"2024-03-28","arxiv_id":"2403.19587","repositories_listed":0,"syntology":null},{"url":null,"slug":"differentially-private-distributed-nonconvex","title":"Differentially Private Distributed Nonconvex Stochastic Optimization with Quantized Communication","date":"2024-03-27","arxiv_id":"2403.18254","repositories_listed":0,"syntology":null},{"url":null,"slug":"dasa-delay-adaptive-multi-agent-stochastic","title":"DASA: Delay-Adaptive Multi-Agent Stochastic Approximation","date":"2024-03-25","arxiv_id":"2403.17247","repositories_listed":0,"syntology":null},{"url":null,"slug":"stochastic-optimization-with-constraints-a","title":"Stochastic Optimization with Constraints: A Non-asymptotic Instance-Dependent Analysis","date":"2024-03-24","arxiv_id":"2404.00042","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-learning-based-solution-approach-to-the","title":"A learning-based solution approach to the application placement problem in mobile edge computing under uncertainty","date":"2024-03-17","arxiv_id":"2403.11259","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-generalized-framework-with-adaptive","title":"An Adaptive Cost-Sensitive Learning and Recursive Denoising Framework for Imbalanced SVM Classification","date":"2024-03-13","arxiv_id":"2403.08378","repositories_listed":0,"syntology":null},{"url":null,"slug":"provable-mutual-benefits-from-federated","title":"Provable Mutual Benefits from Federated Learning in Privacy-Sensitive Domains","date":"2024-03-11","arxiv_id":"2403.06672","repositories_listed":0,"syntology":null},{"url":null,"slug":"streamlining-in-the-riemannian-realm","title":"Streamlining in the Riemannian Realm: Efficient Riemannian Optimization with Loopless Variance Reduction","date":"2024-03-11","arxiv_id":"2403.06677","repositories_listed":0,"syntology":null},{"url":null,"slug":"fill-and-spill-deep-reinforcement-learning","title":"Fill-and-Spill: Deep Reinforcement Learning Policy Gradient Methods for Reservoir Operation Decision and Control","date":"2024-03-07","arxiv_id":"2403.04195","repositories_listed":0,"syntology":null},{"url":null,"slug":"public-data-assisted-private-stochastic","title":"Public-data Assisted Private Stochastic Optimization: Power and Limitations","date":"2024-03-06","arxiv_id":"2403.03856","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-note-on-high-probability-analysis-of","title":"A General Reduction for High-Probability Analysis with General Light-Tailed Distributions","date":"2024-03-05","arxiv_id":"2403.02873","repositories_listed":0,"syntology":null},{"url":null,"slug":"sofim-stochastic-optimization-using","title":"SOFIM: Stochastic Optimization Using Regularized Fisher Information Matrix","date":"2024-03-05","arxiv_id":"2403.02833","repositories_listed":0,"syntology":null},{"url":null,"slug":"beyond-single-model-views-for-deep-learning","title":"Beyond Single-Model Views for Deep Learning: Optimization versus Generalizability of Stochastic Optimization Algorithms","date":"2024-03-01","arxiv_id":"2403.00574","repositories_listed":0,"syntology":null},{"url":null,"slug":"higher-order-measures-of-risk-and-stochastic","title":"Higher order measures of risk and stochastic dominance","date":"2024-02-23","arxiv_id":"2402.15387","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-free-algorithms-for-performative","title":"Parameter-Free Algorithms for Performative Regret Minimization under Decision-Dependent Distributions","date":"2024-02-23","arxiv_id":"2402.15188","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-rolling-horizon-production-planning","title":"Enhancing Rolling Horizon Production Planning Through Stochastic Optimization Evaluated by Means of Simulation","date":"2024-02-22","arxiv_id":"2402.14506","repositories_listed":0,"syntology":null},{"url":null,"slug":"sgd-with-clipping-is-secretly-estimating-the","title":"SGD with Clipping is Secretly Estimating the Median Gradient","date":"2024-02-20","arxiv_id":"2402.12828","repositories_listed":0,"syntology":null},{"url":null,"slug":"surpassing-legacy-approaches-and-human","title":"Surpassing legacy approaches to PWR core reload optimization with single-objective Reinforcement learning","date":"2024-02-16","arxiv_id":"2402.11040","repositories_listed":0,"syntology":null}],"record_sha256":"47ded28eaabd1b868ec2d0e7b30fe45343da88fc0b746bc22bfebaca616c9ff1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}