conftrace_

stochastic optimization

1,137 papers

Explore in graph

Also known as

SO

Co-occurring keywords · papers mentioning both

regret bound (172) non-convex optimization (141) variance reduction (138) online learning (132) multi-armed bandit (117) convex optimization (116) convergence rate (94) stochastic gradient descent (80) gradient descent (65) convergence analysis (53)

Papers

ACE: Adapting sampling for Counterfactual Explanations L4DC 2026 Adaptive Fidelity Estimation for Quantum Programs with Graph-Guided Noise Awareness AAAI 2026 Adaptive Weighted Averaging COLT 2026 A simple, optimal and efficient algorithm for online exp-concave optimization COLT 2026 Beyond Sharpness: The Role of Nonuniformity in Generalization AAAI 2026 Breadth-First Search vs. Restarting Random Walks for Escaping Uninformed Heuristic Regions AAAI 2026 Designing Optimal Mechanisms to Locate Facilities with Insufficient Capacity for Bayesian Agents AAAI 2026 Efficient Contextual Bandit Learning via Reward-Space Sampling and Online Optimization (Student Abstract) AAAI 2026 HEDGE: Traffic Engineering with Probabilistic Link Capacities NSDI 2026 Methods for Optimization Problems with Markovian Stochasticity and Non-Euclidean Geometry AAAI 2026 Online Linear Regression with Paid Stochastic Features AAAI 2026 Stochastic Decentralized Optimization of Non-Smooth Convex and Convex-Concave Problems over Time-Varying Networks AAAI 2026 Stochastic Universal Adversarial Perturbations with Fixed Optimization Constraint and Ensured High-probability Transferability AAAI 2026 Structure-based RNA Design by Step-wise Optimization of Latent Diffusion Model AAAI 2026 TESO: Online Tracking of Essential Matrix by Stochastic Optimization CVPR 2026 Towards Nonlinear Sparse AUC Maximization via Compositional Stochastic Hard Thresholding AAAI 2026 Tree-Based Stochastic Optimization for Solving Large-Scale Urban Network Security Games AAAI 2026 Accelerating neural network training: An analysis of the AlgoPerf competition ICLR 2025 Adaptive Client Sampling in Federated Learning via Online Learning with Bandit Feedback JMLR 2025 An Asynchronous Bundle Method for Distributed Learning Problems ICLR 2025 A Stochastic Approach to the Subset Selection Problem via Mirror Descent ICLR 2025 Batch Ensemble for Variance Dependent Regret in Stochastic Bandits AAAI 2025 Boosting Adversarial Transferability through Augmentation in Hypothesis Space CVPR 2025 Contextual Stochastic Optimization for School Desegregation Policymaking AAAI 2025 Decentralized Bilevel Optimization: A Perspective from Transient Iteration Complexity JMLR 2025