← Optimization & Theory
Machine Learning › Optimization & Theory ›

Stochastic Methods

1077 directly classified papers

Papers per year

Papers

A Stochastic Approach to Bi-Level Optimization for Hyperparameter Optimization and Meta Learning AAAI 2025
Forecasting Competitions with Correlated Events AAAI 2025
Analyzing and Modeling LLM Response Lengths with Extreme Value Theory: Anchoring Effects and Hybrid Distributions EMNLP 2025
Nonconvex Stochastic Bregman Proximal Gradient Method with Application to Deep Learning JMLR 2025
Faster Double Adaptive Gradient Methods AAAI 2025
Stability and Generalization of Zeroth-Order Decentralized Stochastic Gradient Descent with Changing Topology AAAI 2025
ThoughtSculpt: Reasoning with Intermediate Revision and Search NAACL 2025
Offline-to-Online Hyperparameter Transfer for Stochastic Bandits AAAI 2025
Boosting Test Performance with Importance Sampling--a Subpopulation Perspective AAAI 2025
On Adaptive Stochastic Optimization for Streaming Data: A Newton's Method with O(dN) Operations JMLR 2025
Exploring Hybrid Sampling Inference for Aspect-based Sentiment Analysis NAACL 2025
Revisiting Gradient Normalization and Clipping for Nonconvex SGD under Heavy-Tailed Noise: Necessity, Sufficiency, and Acceleration JMLR 2025
Training with Fewer Bits: Unlocking Edge LLMs Training with Stochastic Rounding EMNLP 2025
Accelerating Diffusion Sampling via Exploiting Local Transition Coherence ICCV 2025
Coupling-based Convergence Diagnostic and Stepsize Scheme for Stochastic Gradient Descent AAAI 2025
Monte Carlo Temperature: a robust sampling strategy for LLM’s uncertainty quantification methods NAACL 2025
SIFAR: A Simple Faster Accelerated Variance-Reduced Gradient Method IJCAI 2025
In-Domain African Languages Translation Using LLMs and Multi-armed Bandits ACL 2025
EVOS: Efficient Implicit Neural Training via EVOlutionary Selector CVPR 2025
3D Test-time Adaptation via Graph Spectral Driven Point Shift ICCV 2025
Statistical Inference of Constrained Stochastic Optimization via Sketched Sequential Quadratic Programming JMLR 2025
Near-optimal Per-Action Regret Bounds for Sleeping Bandits AISTATS 2024
Learning the Pareto Set Under Incomplete Preferences: Pure Exploration in Vector Bandits AISTATS 2024
A Score-Based Deterministic Diffusion Algorithm with Smooth Scores for General Distributions AAAI 2024
Improved Sample Complexity Analysis of Natural Policy Gradient Algorithm with General Parameterization for Infinite Horizon Discounted Reward Markov Decision Processes AISTATS 2024