Pages that link to "Item:Q3648521"

The following pages link to Robust Stochastic Approximation Approach to Stochastic Programming (Q3648521):

Displaying 50 items.

• On the Complexity of Random Satisfiability Problems with Planted Solutions (Q4577186) (← links)
• Swarming for Faster Convergence in Stochastic Optimization (Q4582016) (← links)
• Optimizing Adaptive Importance Sampling by Stochastic Approximation (Q4584930) (← links)
• Optimization with Reference-Based Robust Preference Constraints (Q4588856) (← links)
• On Sampling Rates in Simulation-Based Recursions (Q4600839) (← links)
• On the Convergence of Gradient-Like Flows with Noisy Gradient Input (Q4602552) (← links)
• Stochastic Gradient Descent in Continuous Time (Q4607057) (← links)
• Batched Stochastic Gradient Descent with Weighted Sampling (Q4609808) (← links)
• Random Forward Models and Log-Likelihoods in Bayesian Inverse Problems (Q4611529) (← links)
• Variance-Based Extragradient Methods with Line Search for Stochastic Variational Inequalities (Q4620417) (← links)
• Stochastic Model-Based Minimization of Weakly Convex Functions (Q4620418) (← links)
• String-averaging incremental stochastic subgradient algorithms (Q4631774) (← links)
• Stochastic Primal-Dual Coordinate Method for Regularized Empirical Risk Minimization (Q4636997) (← links)
• Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regression (Q4637017) (← links)
• Accelerating Stochastic Composition Optimization (Q4637024) (← links)
• (Q4637063) (← links)
• A Central Limit Theorem and Hypotheses Testing for Risk-averse Stochastic Programs (Q4641663) (← links)
• Optimization Methods for Large-Scale Machine Learning (Q4641709) (← links)
• On the regularizing property of stochastic gradient descent (Q4646419) (← links)
• Random Gradient Extrapolation for Distributed and Stochastic Optimization (Q4687240) (← links)
• Minimax Optimal Procedures for Locally Private Estimation (Q4690944) (← links)
• Robust stochastic maximum principle for multi-model worst case optimization (Q4804440) (← links)
• Stochastic Subgradient Estimation Training for Support Vector Machines (Q4922840) (← links)
• Statistics of Robust Optimization: A Generalized Empirical Likelihood Approach (Q4958550) (← links)
• Optimal survey schemes for stochastic gradient descent with applications to <i>M</i>-estimation (Q4967801) (← links)
• Robust Asynchronous Stochastic Gradient-Push: Asymptotically Optimal and Network-Independent Performance for Strongly Convex Functions (Q4969107) (← links)
• (Q4969178) (← links)
• (Q4969198) (← links)
• (Q4969246) (← links)
• (Q4969260) (← links)
• Technical Note—Perishable Inventory Systems: Convexity Results for Base-Stock Policies and Learning Algorithms Under Censored Demand (Q4971563) (← links)
• Robust Analysis in Stochastic Simulation: Computation and Performance Guarantees (Q4971591) (← links)
• Robust Power Management via Learning and Game Design (Q4994161) (← links)
• (Q4998897) (← links)
• (Q4998940) (← links)
• (Q4998961) (← links)
• (Q4998966) (← links)
• (Q4999081) (← links)
• Sampled limited memory methods for massive linear inverse problems (Q5000590) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• Nonparametric Learning Algorithms for Joint Pricing and Inventory Control with Lost Sales and Censored Demand (Q5000652) (← links)
• Weakly Convex Optimization over Stiefel Manifold Using Riemannian Subgradient-Type Methods (Q5003207) (← links)
• A Finite Time Analysis of Temporal Difference Learning with Linear Function Approximation (Q5003727) (← links)
• On the Effectiveness of Richardson Extrapolation in Data Science (Q5018900) (← links)
• Distributed Bregman-Distance Algorithms for Min-Max Optimization (Q5023087) (← links)
• Fast Decentralized Nonconvex Finite-Sum Optimization with Recursive Variance Reduction (Q5026835) (← links)
• Proximal Gradient Methods for Machine Learning and Imaging (Q5028165) (← links)
• Some Limit Properties of Markov Chains Induced by Recursive Stochastic Algorithms (Q5037552) (← links)
• A fully stochastic second-order trust region method (Q5043844) (← links)
• Efficient numerical methods to solve sparse linear equations with application to PageRank (Q5043846) (← links)