Search results for "no-regret"

Hits ?▲	Authors	Title	Venue	Year	Link	Author keywords
207	Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, Jennifer Wortman	Regret to the best vs. regret to the average.	Mach. Learn.	2008	DBLP DOI BibTeX RDF	Prediction with expert advice, Lower bounds, Online learning, Regret minimization
187	Eyal Even-Dar, Michael J. Kearns, Yishay Mansour, Jennifer Wortman	Regret to the Best vs. Regret to the Average.	COLT	2007	DBLP DOI BibTeX RDF
150	Amy Greenwald, Amir Jafari	A General Class of No-Regret Learning Algorithms and Game-Theoretic Equilibria.	COLT	2003	DBLP DOI BibTeX RDF
133	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Complexity of the Min-Max (Regret) Versions of Cut Problems.	ISAAC	2005	DBLP DOI BibTeX RDF	min-max regret, s–t min cut, complexity, min cut, min-max
120	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximation Complexity of min-max (Regret) Versions of Shortest Path, Spanning Tree, and Knapsack.	ESA	2005	DBLP DOI BibTeX RDF	min-max regret, mi-nimum spanning tree, approximation, shortest path, knapsack, min-max, fptas
113	John Langford 0001, Alina Beygelzimer	Sensitive Error Correcting Output Codes.	COLT	2005	DBLP DOI BibTeX RDF
112	Jason R. Marden, Gürdal Arslan, Jeff S. Shamma	Regret based dynamics: convergence in weakly acyclic games.	AAMAS	2007	DBLP DOI BibTeX RDF	game theory, learning algorithms, emergent behavior, multiagent learning, cooperative distributed problem solving
108	Baruch Awerbuch, Thomas P. Hayes	Online collaborative filtering with nearly optimal dynamic regret.	SPAA	2007	DBLP DOI BibTeX RDF	online decision making, regret, learning, collaborative filtering, multiagent systems
100	Darius Braziunas, Craig Boutilier	Assessing regret-based preference elicitation with the UTPREF recommendation system.	EC	2010	DBLP DOI BibTeX RDF	utility elicitation, recommender systems, user studies
87	Geoffrey J. Gordon, Amy Greenwald, Casey Marks	No-regret learning in convex games.	ICML	2008	DBLP DOI BibTeX RDF
87	Avrim Blum, Yishay Mansour	From External to Internal Regret.	COLT	2005	DBLP DOI BibTeX RDF
84	Nikhil R. Devanur, Sham M. Kakade	The price of truthfulness for pay-per-click auctions.	EC	2009	DBLP DOI BibTeX RDF	regret, auction, online, truthful, multi-armed bandit, pay-per-click
83	Gilles Stoltz, Gábor Lugosi	Internal Regret in On-Line Portfolio Selection.	Mach. Learn.	2005	DBLP DOI BibTeX RDF	individual sequences, internal regret, on-line investment, universal Portfolio, EG strategy
76	Sébastien Bubeck, Rémi Munos, Gilles Stoltz	Pure Exploration in Multi-armed Bandits Problems.	ALT	2009	DBLP DOI BibTeX RDF
76	Elad Hazan, C. Seshadhri 0001	Efficient learning algorithms for changing environments.	ICML	2009	DBLP DOI BibTeX RDF
76	Jean-Yves Audibert, Rémi Munos, Csaba Szepesvári	Tuning Bandit Algorithms in Stochastic Environments.	ALT	2007	DBLP DOI BibTeX RDF
76	Rani Yaroshinsky, Ran El-Yaniv, Steven S. Seiden	How to Better Use Expert Advice.	Mach. Learn.	2004	DBLP DOI BibTeX RDF	online prediction, learning from expert advice, online learning
75	Jan-P. Calliess	On Fixed Convex Combinations of No-Regret Learners.	MLDM	2009	DBLP DOI BibTeX RDF
75	M. P. Mulaudzi, Mark Adam Petersen, I. M. Schoeman	Optimal allocation between bank loans and treasuries with regret.	Optim. Lett.	2008	DBLP DOI BibTeX RDF	Optimization theory, Financial economics, Credit crunch, Banks
75	Varsha Dani, Thomas P. Hayes	Robbing the bandit: less regret in online geometric optimization against an adaptive adversary.	SODA	2006	DBLP DOI BibTeX RDF
70	Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang	Improved algorithms for the minmax-regret 1-center and 1-median problems.	ACM Trans. Algorithms	2008	DBLP DOI BibTeX RDF	minmax-regret optimization, trees, medians, Location theory, centers, general graphs
70	Elad Hazan, Amit Agarwal 0008, Satyen Kale	Logarithmic regret algorithms for online convex optimization.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Online learning, Portfolio management, Online optimization, Regret minimization
70	Hassene Aissi, Cristina Bazgan, Daniel Vanderpooten	Approximating Min-Max (Regret) Versions of Some Polynomial Problems.	COCOON	2006	DBLP DOI BibTeX RDF	min-max regret, approximation, shortest path, minimum spanning tree, min-max, fptas
63	Elad Hazan, Satyen Kale	Better algorithms for benign bandits.	SODA	2009	DBLP DOI BibTeX RDF
63	Bikramjit Banerjee, Jing Peng	Generalized multiagent learning with performance bound.	Auton. Agents Multi Agent Syst.	2007	DBLP DOI BibTeX RDF	Multiagent reinforcement learning, Game theory
63	Yonina C. Eldar, Neri Merhav	Minimax MSE-ratio estimation with signal covariance uncertainties.	IEEE Trans. Signal Process.	2005	DBLP DOI BibTeX RDF
62	Gilles Stoltz, Gábor Lugosi	Internal Regret in On-Line Portfolio Selection.	COLT	2003	DBLP DOI BibTeX RDF
61	Avrim Blum, Eyal Even-Dar, Katrina Ligett	Routing without regret: on convergence to nash equilibria of regret-minimizing algorithms in routing games.	PODC	2006	DBLP DOI BibTeX RDF	game theory, network games
57	Eyal Even-Dar, Yishay Mansour, Uri Nadav	On the convergence of regret minimization dynamics in concave games.	STOC	2009	DBLP DOI BibTeX RDF	learning equilibrium, algorithmic game theory, regret minimization
57	Avrim Blum, MohammadTaghi Hajiaghayi, Katrina Ligett, Aaron Roth 0001	Regret minimization and the price of total anarchy.	STOC	2008	DBLP DOI BibTeX RDF	nash equilibria, algorithmic game theory, regret minimization
57	Tzu-Chin Lin, Hung-I Yu, Biing-Feng Wang	Improved Algorithms for the Minmax-Regret 1-Center Problem.	ISAAC	2006	DBLP DOI BibTeX RDF	minmax-regret optimization, location theory, centers
57	Hung-I Yu, Tzu-Chin Lin, Biing-Feng Wang	Improved Algorithms for the Minmax Regret 1-Median Problem.	COCOON	2006	DBLP DOI BibTeX RDF	minmax regret optimization, medians, Location theory
49	Vianney Perchet	Calibration and Internal No-Regret with Random Signals.	ALT	2009	DBLP DOI BibTeX RDF
49	Elad Hazan, Adam Kalai, Satyen Kale, Amit Agarwal 0008	Logarithmic Regret Algorithms for Online Convex Optimization.	COLT	2006	DBLP DOI BibTeX RDF
49	Bikramjit Banerjee, Jing Peng	Unifying Convergence and No-Regret in Multiagent Learning.	LAMAS	2005	DBLP DOI BibTeX RDF
46	Tim Roughgarden	Intrinsic robustness of the price of anarchy.	STOC	2009	DBLP DOI BibTeX RDF	regret-minimizat, price of anarchy, nash equilibria, congestion games
46	Nie Nie, Cristina Comaniciu	Adaptive Channel Allocation Spectrum Etiquette for Cognitive Radio Networks.	Mob. Networks Appl.	2006	DBLP DOI BibTeX RDF	potential game, no-regret learning, cognitive radio, channel allocation
46	Nicolò Cesa-Bianchi, Gábor Lugosi	Potential-Based Algorithms in Online Prediction and Game Theory.	COLT/EuroCOLT	2001	DBLP DOI BibTeX RDF	universal prediction, Blackwell's strategy, weighted average predictors, internal regret, boosting, on-line learning, Perceptron algorithm
45	Paolo Viappiani, Craig Boutilier	Regret-based optimal recommendation sets in conversational recommender systems.	RecSys	2009	DBLP DOI BibTeX RDF	minimax regret, recommender systems, preference elicitation, critiquing
45	Alfredo Candia-Véjar, Eduardo Álvarez-Miranda	On a Class of Interval Data Minmax Regret CO Problems.	OR	2007	DBLP DOI BibTeX RDF	minmax regret, Approximation algorithm, interval data
38	Moshe Babaioff, Yogeshwer Sharma, Aleksandrs Slivkins	Characterizing truthful multi-armed bandit mechanisms: extended abstract.	EC	2009	DBLP DOI BibTeX RDF	single-parameter auctions, mechanism design, online learning, multi-armed bandits, truthful mechanisms
38	Maria-Florina Balcan, Nikhil Bansal 0001, Alina Beygelzimer, Don Coppersmith, John Langford 0001, Gregory B. Sorkin	Robust reductions from ranking to classification.	Mach. Learn.	2008	DBLP DOI BibTeX RDF	Classification, Ranking, Reductions
38	Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz	Improved second-order bounds for prediction with expert advice.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Individual sequences, Prediction with expert advice, Exponentially weighted averages
38	Jussi Kujala, Tapio Elomaa	Following the Perturbed Leader to Gamble at Multi-armed Bandits.	ALT	2007	DBLP DOI BibTeX RDF
38	Peter Auer, Ronald Ortner, Csaba Szepesvári	Improved Rates for the Stochastic Continuum-Armed Bandit Problem.	COLT	2007	DBLP DOI BibTeX RDF
38	Maria-Florina Balcan, Nikhil Bansal 0001, Alina Beygelzimer, Don Coppersmith, John Langford 0001, Gregory B. Sorkin	Robust Reductions from Ranking to Classification.	COLT	2007	DBLP DOI BibTeX RDF
38	Pascal Van Hentenryck, Russell Bent, Yannis Vergados	Online Stochastic Reservation Systems.	CPAIOR	2006	DBLP DOI BibTeX RDF
38	Panrasee Ritthipravat, Thavida Maneewarn, Jeremy L. Wyatt, Djitt Laowattana	Fuzzy-Q Knowledge Sharing Techniques with Expertness Measures: Comparison and Analysis.	CSR	2006	DBLP DOI BibTeX RDF
38	Nicolò Cesa-Bianchi, Yishay Mansour, Gilles Stoltz	Improved Second-Order Bounds for Prediction with Expert Advice.	COLT	2005	DBLP DOI BibTeX RDF
37	Yiling Chen 0001, Jennifer Wortman Vaughan	A new understanding of prediction markets via no-regret learning.	EC	2010	DBLP DOI BibTeX RDF	follow the regularized leader, prediction with expert advice, online learning, prediction markets, market scoring rules
37	Mark D. Reid, Robert C. Williamson	Surrogate regret bounds for proper losses.	ICML	2009	DBLP DOI BibTeX RDF
37	Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard	Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality.	SOFSEM	2008	DBLP DOI BibTeX RDF	Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data
37	Anna Gambin, Ewa Szczurek	No-Regret Boosting.	ICANNGA (1)	2007	DBLP DOI BibTeX RDF
37	Yu-Han Chang, Leslie Pack Kaelbling	Hedged learning: regret-minimization with learning experts.	ICML	2005	DBLP DOI BibTeX RDF
37	Joe Kilian, Kevin J. Lang, Barak A. Pearlmutter	Playing the Matching-Shoulders Lob-Pass Game with Logarithmic Regret.	COLT	1994	DBLP DOI BibTeX RDF
33	Craig Boutilier, Kevin Regan 0001, Paolo Viappiani	Preference elicitation with subjective features.	RecSys	2009	DBLP DOI BibTeX RDF	minimax regret, recommender systems, concept learning, preference elicitation, version space
33	Michael Dinitz	Brief announcement: distributed algorithms for approximating wireless network capacity.	PODC	2009	DBLP DOI BibTeX RDF	no-regret, approximation algorithms, distributed algorithms, network capacity
33	Nicolò Cesa-Bianchi, Gábor Lugosi	Potential-Based Algorithms in On-Line Prediction and Game Theory.	Mach. Learn.	2003	DBLP DOI BibTeX RDF	universal prediction, Blackwell's strategy, weighted average predictors, internal regret, boosting, on-line learning, perceptron algorithm
32	Jeremiah Blocki, Nicolas Christin, Anupam Datta, Arunesh Sinha	Regret Minimizing Audits: A Learning-Theoretic Basis for Privacy Protection.	CSF	2011	DBLP DOI BibTeX RDF	Auditing Learning Game Model Regret Minimization Economics
32	Marcin Siepak, Jerzy Józefczyk	Minmax Regret Algorithms for Uncertain PCmax Problem with Interval Processing Times.	ICSEng	2011	DBLP DOI BibTeX RDF	minmax regret, resource allocation, uncertainty, task scheduling, Scatter Search
32	Erick Delage	Regret-based online ranking for a growing digital library.	KDD	2009	DBLP DOI BibTeX RDF	exploration-exploitation, web search, learning to rank, click-through data, regret minimization
32	Hassene Aissi	Approximation and resolution of min-max and min-max regret versions of combinatorial optimization problems.	4OR	2006	DBLP DOI BibTeX RDF	Min-max regret, Complexity, Combinatorial optimization, Approximation, Data association, Robustness analysis, Min-max
25	Stéphane Boucheron, Aurélien Garivier, Elisabeth Gassiat	Coding on Countably Infinite Alphabets.	IEEE Trans. Inf. Theory	2009	DBLP DOI BibTeX RDF
25	Alina Beygelzimer, John Langford 0001	The offset tree for learning with partial labels.	KDD	2009	DBLP DOI BibTeX RDF	associative reinforcement learning, contextual bandits, interactive learning
25	Zhengya Sun, Tao Qin, Qing Tao, Jue Wang 0004	Robust sparse rank learning for non-smooth ranking measures.	SIGIR	2009	DBLP DOI BibTeX RDF	rsrank, truncated gradient, information retrieval, learn to rank
25	Jia Yuan Yu, Shie Mannor	Piecewise-stationary bandit problems with side observations.	ICML	2009	DBLP DOI BibTeX RDF
25	Ilya Sutskever	A simpler unified analysis of budget perceptrons.	ICML	2009	DBLP DOI BibTeX RDF
25	Aaron Roth 0001	The Price of Malice in Linear Congestion Games.	WINE	2008	DBLP DOI BibTeX RDF
25	Jean-François Hren, Rémi Munos	Optimistic Planning of Deterministic Systems.	EWRL	2008	DBLP DOI BibTeX RDF
25	Jia Yuan Yu, Shie Mannor, Nahum Shimkin	Markov Decision Processes with Arbitrary Reward Processes.	EWRL	2008	DBLP DOI BibTeX RDF
25	Vladimir Vovk	Competing with wild prediction rules.	Mach. Learn.	2007	DBLP DOI BibTeX RDF	Competitive on-line prediction, Square loss regression, Banach function space
25	Suleyman Serdar Kozat, Andrew C. Singer, Georg Zeitler	Universal Piecewise Linear Prediction Via Context Trees.	IEEE Trans. Signal Process.	2007	DBLP DOI BibTeX RDF
25	Nathaniel Good, Jens Grossklags, Deirdre K. Mulligan, Joseph A. Konstan	Noticing notice: a large-scale experiment on the timing of software license agreements.	CHI	2007	DBLP DOI BibTeX RDF	end user license agreement, notice, security, privacy, timing, spyware
25	Sandeep Pandey, Deepayan Chakrabarti, Deepak Agarwal	Multi-armed bandit problems with dependent arms.	ICML	2007	DBLP DOI BibTeX RDF
25	Nadia Zerida, Nadine Lucas, Bruno Crémilleux	Exclusion-inclusion based text categorization of biomedical articles.	ACM Symposium on Document Engineering	2007	DBLP DOI BibTeX RDF	text mining, categorization, characterisation
25	Yonina C. Eldar	Robust Competitive Estimation With Signal and Noise Covariance Uncertainties.	IEEE Trans. Inf. Theory	2006	DBLP DOI BibTeX RDF
25	Yonina C. Eldar	Minimax estimation of deterministic parameters in linear models with a random model matrix.	IEEE Trans. Signal Process.	2006	DBLP DOI BibTeX RDF
25	Eyal Even-Dar, Michael J. Kearns, Jennifer Wortman	Risk-Sensitive Online Learning.	ALT	2006	DBLP DOI BibTeX RDF
25	Shie Mannor, Nahum Shimkin	Online Learning with Variable Stage Duration.	COLT	2006	DBLP DOI BibTeX RDF
25	Vladimir Vovk	Competing with Wild Prediction Rules.	COLT	2006	DBLP DOI BibTeX RDF
25	Panrasee Ritthipravat, Thavida Maneewarn, Jeremy L. Wyatt, Djitt Laowattana	Comparison and Analysis of Expertness Measure in Knowledge Sharing Among Robots.	IEA/AIE	2006	DBLP DOI BibTeX RDF
25	Amit Agarwal 0008, Elad Hazan, Satyen Kale, Robert E. Schapire	Algorithms for portfolio management based on the Newton method.	ICML	2006	DBLP DOI BibTeX RDF
25	Yonina C. Eldar	Robust deconvolution of deterministic and random signals.	IEEE Trans. Inf. Theory	2005	DBLP DOI BibTeX RDF
25	Abraham Flaxman, Adam Tauman Kalai, H. Brendan McMahan	Online convex optimization in the bandit setting: gradient descent without a gradient.	SODA	2005	DBLP BibTeX RDF
25	Jussi Kujala, Tapio Elomaa	On Following the Perturbed Leader in the Bandit Setting.	ALT	2005	DBLP DOI BibTeX RDF
25	Jan Poland	FPL Analysis for Adaptive Bandits.	SAGA	2005	DBLP DOI BibTeX RDF
25	Adam Kalai, Santosh S. Vempala	Efficient Algorithms for Online Decision Problems.	COLT	2003	DBLP DOI BibTeX RDF
25	Amy Greenwald, Jeffrey O. Kephart	Probabilistic pricebots.	Agents	2001	DBLP DOI BibTeX RDF	economic software agents, pricebots, shopbots
25	Ronen I. Brafman, Moshe Tennenholtz	An axiomatic treatment of three qualitative decision criteria.	J. ACM	2000	DBLP DOI BibTeX RDF	choice theory, foundations of online algorithms, qualitative decision theory, agent models
25	Eiji Takimoto, Manfred K. Warmuth	The Last-Step Minimax Algorithm.	ALT	2000	DBLP DOI BibTeX RDF
24	Robert D. Kleinberg, Georgios Piliouras, Éva Tardos	Load balancing without regret in the bulletin board model.	PODC	2009	DBLP DOI BibTeX RDF	game theory, price of anarchy, learning theory
24	Robert Kleinberg, Georgios Piliouras, Éva Tardos	Multiplicative updates outperform generic no-regret learning in congestion games: extended abstract.	STOC	2009	DBLP DOI BibTeX RDF	game theory, price of anarchy, learning theory
24	Gregory Z. Gutin, Boris Goldengorin, Jing Huang 0007	Worst case analysis of Max-Regret, Greedy and other heuristics for Multidimensional Assignment and Traveling Salesman Problems.	J. Heuristics	2008	DBLP DOI BibTeX RDF	Traveling salesman problem, Greedy heuristics, Multidimensional assignment problem, Domination analysis
24	Justo Puerto, Antonio M. Rodríguez-Chía, Arie Tamir	New Results on Minimax Regret Single Facility Ordered Median Location Problems on Networks.	ESA	2007	DBLP DOI BibTeX RDF	networks, facility location, Analysis of algorithms
24	Yishay Mansour	Learning, regret minimization and option pricing.	TARK	2007	DBLP DOI BibTeX RDF
24	Stefan König 0001, Sven Kaffille, Guido Wirtz	Implementing ReGreT in a Decentralized Multi-agent Environment.	MATES	2007	DBLP DOI BibTeX RDF
24	Adina Magda Florea, Eugenia Kalisz	Adaptive Negotiation Based on Rewards and Regret in a Multi-Agent Environment.	SYNASC	2007	DBLP DOI BibTeX RDF
24	Yunzhou Wu, Prashant Doshi	Regret-Based Decentralized Adaptation ofWeb Processes with Coordination Constraints.	IEEE SCC	2007	DBLP DOI BibTeX RDF
24	Gregory Z. Gutin, Boris Goldengorin, Jing Huang 0007	Worst Case Analysis of Max-Regret, Greedy and Other Heuristics for Multidimensional Assignment and Traveling Salesman Problems.	WAOA	2006	DBLP DOI BibTeX RDF
24	Eduardo Conde	An improved algorithm for selecting p items with uncertain returns according to the minmax-regret criterion.	Math. Program.	2004	DBLP DOI BibTeX RDF	complexity, knapsack problem, robust optimization, polynomial algorithm