Pages that link to "Item:Q2568459"
From MaRDI portal
The following pages link to Efficient algorithms for online decision problems (Q2568459):
Displaying 50 items.
- Lower bounds on individual sequence regret (Q285930) (← links)
- Combining initial segments of lists (Q391737) (← links)
- Online variance minimization (Q420931) (← links)
- Combinatorial bandits (Q439986) (← links)
- Replicator dynamics: old and new (Q828036) (← links)
- Feature-aware regularization for sparse online learning (Q893629) (← links)
- Logarithmic regret algorithms for online convex optimization (Q1009221) (← links)
- Regret to the best vs. regret to the average (Q1009274) (← links)
- Perspectives on multiagent learning (Q1028921) (← links)
- The Canadian Traveller Problem and its competitive analysis (Q1037454) (← links)
- On minimaxity of follow the leader strategy in the stochastic setting (Q1663642) (← links)
- Scale-free online learning (Q1704560) (← links)
- Sampled fictitious play is Hannan consistent (Q1753299) (← links)
- Online multiple kernel classification (Q1945032) (← links)
- Extracting certainty from uncertainty: regret bounded by variation in costs (Q1959595) (← links)
- Regret bounds for sleeping experts and bandits (Q1959599) (← links)
- Machine learning advised algorithms for the ski rental problem with a discount (Q2089688) (← links)
- Learning in auctions: regret is hard, envy is easy (Q2155904) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- Regret bounded by gradual variation for online convex optimization (Q2251474) (← links)
- The covering Canadian traveller problem (Q2440168) (← links)
- Online linear optimization and adaptive routing (Q2462507) (← links)
- Regrets of proximal method of multipliers for online non-convex optimization with long term constraints (Q2679238) (← links)
- Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models (Q2680788) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- Unified Algorithms for Online Learning and Competitive Analysis (Q2806821) (← links)
- On modification of population-based search algorithms for convergence in stochastic combinatorial optimization (Q2808309) (← links)
- Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty (Q2830750) (← links)
- A Combinatorial Metrical Task System Problem Under the Uniform Metric (Q2831385) (← links)
- How the Experts Algorithm Can Help Solve LPs Online (Q2833109) (← links)
- Online Linear Optimization for Job Scheduling Under Precedence Constraints (Q2835641) (← links)
- The Post-Disaster Debris Clearance Problem Under Incomplete Information (Q3195231) (← links)
- Oracle-Based Robust Optimization via Online Learning (Q3450465) (← links)
- (Q4558509) (← links)
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback (Q4596721) (← links)
- (Q4637020) (← links)
- Online Learning over a Finite Action Set with Limited Switching (Q4991672) (← links)
- Efficient Online Linear Optimization with Approximation Algorithms (Q4991673) (← links)
- (Q4998871) (← links)
- (Q5053185) (← links)
- Structured Robust Submodular Maximization: Offline and Online Algorithms (Q5084617) (← links)
- Multi-Finger Binary Search Trees (Q5091047) (← links)
- Online Learning Based on Online DCA and Application to Online Classification (Q5131197) (← links)
- Online First-Order Framework for Robust Convex Optimization (Q5131545) (← links)
- AN ONLINE PORTFOLIO SELECTION ALGORITHM WITH REGRET LOGARITHMIC IN PRICE VARIATION (Q5247422) (← links)
- An Online Policy Gradient Algorithm for Markov Decision Processes with Continuous States and Actions (Q5380403) (← links)
- (Q5381125) (← links)
- Equilibria of Greedy Combinatorial Auctions (Q5737806) (← links)
- Near-Optimal Algorithms for Online Matrix Prediction (Q5737809) (← links)
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
