No abstract available.
Cited By
- Wu P, Huang H and Liu Z Online Sequential Decision-Making with Unknown Delays Proceedings of the ACM Web Conference 2024, (4028-4036)
- Bourel M, Cugliari J, Goude Y and Poggi J (2024). Boosting diversity in regression ensembles, Statistical Analysis and Data Mining, 17:1, Online publication date: 9-Feb-2024.
- Cesa-Bianchi N, Cesari T, Colomboni R, Fusco F and Leonardi S (2024). Bilateral Trade, Mathematics of Operations Research, 49:1, (171-203), Online publication date: 1-Feb-2024.
- Lam H, Zhang X and Zhang X (2023). Enhanced Balancing of Bias-Variance Tradeoff in Stochastic Estimation, Operations Research, 71:6, (2352-2373), Online publication date: 1-Nov-2023.
- Zhang H, Niu L, Zheng Z, Zhang Z, Gu S, Wu F, Yu C, Xu J, Chen G and Zheng B A Personalized Automated Bidding Framework for Fairness-aware Online Advertising Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (5544-5553)
- Liu R, Liu Q and Ge T Fairness-Aware Continuous Predictions of Multiple Analytics Targets in Dynamic Networks Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, (1512-1523)
- Liu Y, Zhao W and Dong D (2023). Gradient‐free algorithms for distributed online convex optimization, Asian Journal of Control, 25:4, (2451-2468), Online publication date: 2-Jul-2023.
- Collina N, Arunachaleswaran E and Kearns M Efficient Stackelberg Strategies for Finitely Repeated Games Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (643-651)
- Duan Z, Huang W, Zhang D, Du Y, Wang J, Yang Y and Deng X Is Nash Equilibrium Approximator Learnable? Proceedings of the 2023 International Conference on Autonomous Agents and Multiagent Systems, (233-241)
- Razeghi B, Calmon F, Gunduz D and Voloshynovskiy S (2023). Bottlenecks CLUB: Unifying Information-Theoretic Trade-Offs Among Complexity, Leakage, and Utility, IEEE Transactions on Information Forensics and Security, 18, (2060-2075), Online publication date: 1-Jan-2023.
- Yang G, Poovendran R and Hespanha J Adaptive learning in two-player Stackelberg games with continuous action sets 2019 IEEE 58th Conference on Decision and Control (CDC), (6905-6911)
- Borrageiro G, Firoozye N and Barucca P Sequential asset ranking in nonstationary time series Proceedings of the Third ACM International Conference on AI in Finance, (454-462)
- Lian H, Atwood J, Hou B, Wu J and He Y Online Deep Learning from Doubly-Streaming Data Proceedings of the 30th ACM International Conference on Multimedia, (3185-3194)
- Zheng T and Wen Z Online Convolutional Neural Network for Image Streams Classification Proceedings of the 5th International Conference on Big Data Technologies, (255-259)
- Zhang J, Zeng C, Zhang H, Hu S and Chen K LiteFlow Proceedings of the ACM SIGCOMM 2022 Conference, (414-427)
- Amara-Ouali Y, Goude Y, Hamrouche B and Bishara M A benchmark of electric vehicle load and occupancy models for day-ahead forecasting on open charging session data Proceedings of the Thirteenth ACM International Conference on Future Energy Systems, (193-207)
- Bondaschi M and Gastpar M Alpha-NML Universal Predictors 2022 IEEE International Symposium on Information Theory (ISIT), (468-473)
- Bhattacharya S and Narayan P Shared Information for a Markov Chain on a Tree 2022 IEEE International Symposium on Information Theory (ISIT), (3049-3054)
- Asher N and Hunter J When learning becomes impossible Proceedings of the 2022 ACM Conference on Fairness, Accountability, and Transparency, (107-116)
- Srinivas V, Woodruff D, Xu Z and Zhou S Memory bounds for the experts problem Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing, (1158-1171)
- Jamil W and Bouchachia A (2022). Iterative ridge regression using the aggregating algorithm, Pattern Recognition Letters, 158:C, (34-41), Online publication date: 1-Jun-2022.
- Kalnishkan Y (2022). Prediction with expert advice for a finite number of experts, Pattern Recognition, 126:C, Online publication date: 1-Jun-2022.
- Dinh L Online Learning against Strategic Adversary Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, (1841-1842)
- Pérolat J, Perrin S, Elie R, Laurière M, Piliouras G, Geist M, Tuyls K and Pietquin O Scaling Mean Field Games by Online Mirror Descent Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, (1028-1037)
- Czechowski A and Piliouras G Poincaré-Bendixson Limit Sets in Multi-Agent Learning Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, (318-326)
- Spelda P and Stritecky V (2021). Human Induction in Machine Learning, ACM Computing Surveys, 54:3, (1-18), Online publication date: 30-Apr-2022.
- Zhu M, Wang Y, Wu F, Yang M, Chen C, Liang Q and Zheng X WISE: Wavelet based Interpretable Stock Embedding for Risk-Averse Portfolio Management Companion Proceedings of the Web Conference 2022, (1-11)
- Deng X, Hu X, Lin T and Zheng W Nash Convergence of Mean-Based Learning Algorithms in First Price Auctions Proceedings of the ACM Web Conference 2022, (141-150)
- Kolumbus Y and Nisan N Auctions between Regret-Minimizing Agents Proceedings of the ACM Web Conference 2022, (100-111)
- Toccaceli P (2022). Introduction to conformal predictors, Pattern Recognition, 124:C, Online publication date: 1-Apr-2022.
- Nuara A, Trovò F, Gatti N and Restelli M (2022). Online joint bid/daily budget optimization of Internet advertising campaigns, Artificial Intelligence, 305:C, Online publication date: 1-Apr-2022.
- Anantharam V (2022). Weakening the grip of the model, Queueing Systems: Theory and Applications, 100:3-4, (385-387), Online publication date: 1-Apr-2022.
- Tran A, Eldred M, Wildey T, McCann S, Sun J and Visintainer R (2022). aphBO-2GP-3B: a budgeted asynchronous parallel multi-acquisition functions for constrained Bayesian optimization on high-performing computing architecture, Structural and Multidisciplinary Optimization, 65:4, Online publication date: 1-Apr-2022.
- Dong J, Li K, Li S and Wang B Combinatorial Bandits under Strategic Manipulations Proceedings of the Fifteenth ACM International Conference on Web Search and Data Mining, (219-229)
- V’yugin V and Trunov V (2021). Online aggregation of probability forecasts with confidence, Pattern Recognition, 121:C, Online publication date: 1-Jan-2022.
- Parras J, Apellániz P and Zazo S (2022). An online learning algorithm to play discounted repeated games in wireless networks, Engineering Applications of Artificial Intelligence, 107:C, Online publication date: 1-Jan-2022.
- Zhang Y, Lin H, Yang X and Long W (2021). Combining expert weights for online portfolio selection based on the gradient descent algorithm, Knowledge-Based Systems, 234:C, Online publication date: 25-Dec-2021.
- Korotin A, V’yugin V and Burnaev E (2021). Mixability of integral losses, Pattern Recognition, 120:C, Online publication date: 1-Dec-2021.
- Hoi S, Sahoo D, Lu J and Zhao P (2021). Online learning, Neurocomputing, 459:C, (249-289), Online publication date: 12-Oct-2021.
- Zhao C, Chen F and Thuraisingham B Fairness-Aware Online Meta-learning Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining, (2294-2304)
- Lin S, Dedeoglu M and Zhang J Accelerating Distributed Online Meta-Learning via Multi-Agent Collaboration under Limited Communication Proceedings of the Twenty-second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, (261-270)
- Tripathi V and Modiano E An Online Learning Approach to Optimizing Time-Varying Costs of AoI Proceedings of the Twenty-second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing, (241-250)
- Diana E, Gill W, Kearns M, Kenthapadi K and Roth A Minimax Group Fairness: Algorithms and Experiments Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society, (66-76)
- Cesa-Bianchi N, Cesari T, Colomboni R, Fusco F and Leonardi S A Regret Analysis of Bilateral Trade Proceedings of the 22nd ACM Conference on Economics and Computation, (289-309)
- Chang H (2021). An index-based deterministic convergent optimal algorithm for constrained multi-armed bandit problems, Automatica (Journal of IFAC), 129:C, Online publication date: 1-Jul-2021.
- Atashin A, Razeghi B, Gündüz D and Voloshynovskiy S Variational Leakage Proceedings of the 3rd ACM Workshop on Wireless Security and Machine Learning, (91-96)
- Daskalakis C, Skoulakis S and Zampetakis M The complexity of constrained min-max optimization Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, (1466-1478)
- Liu T and Wang I Privacy-Utility Tradeoff with Nonspecific Tasks: Robust Privatization and Minimum Leakage 2020 IEEE Information Theory Workshop (ITW), (1-5)
- Feng J Learning to safely approve updates to machine learning algorithms Proceedings of the Conference on Health, Inference, and Learning, (164-173)
- Kocak M, Ramirez D, Erkip E and Shasha D (2021). SafePredict: A Meta-Algorithm for Machine Learning That Uses Refusals to Guarantee Correctness, IEEE Transactions on Pattern Analysis and Machine Intelligence, 43:2, (663-678), Online publication date: 1-Feb-2021.
- Abernethy J, Lai K and Wibisono A Fast convergence of fictitious play for diagonal payoff matrices Proceedings of the Thirty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, (1387-1404)
- Bayraktar E, Poor H and Zhang X (2020). Malicious Experts Versus the Multiplicative Weights Algorithm in Online Prediction, IEEE Transactions on Information Theory, 67:1, (559-565), Online publication date: 1-Jan-2021.
- Etesami S, Kiyavash N, Leon V and Poor H (2021). Optimal Adversarial Policies in the Multiplicative Learning System With a Malicious Expert, IEEE Transactions on Information Forensics and Security, 16, (2276-2287), Online publication date: 1-Jan-2021.
- Lindståhl S, Proutiere A and Johnsson A Predictive Bandits 2020 59th IEEE Conference on Decision and Control (CDC), (1170-1176)
- Rubies-Royo V, Mazumdar E, Dong R, Tomlin C and Sastry S Expert Selection in High-Dimensional Markov Decision Processes 2020 59th IEEE Conference on Decision and Control (CDC), (3604-3610)
- Slivkins A (2020). Book announcement: Introduction to Multi-Armed Bandits, ACM SIGecom Exchanges, 18:1, (28-30), Online publication date: 2-Dec-2020.
- Rosasco L, Villa S and Vũ B (2019). Convergence of Stochastic Proximal Gradient Algorithm, Applied Mathematics and Optimization, 82:3, (891-917), Online publication date: 1-Dec-2020.
- Asgari K and Neely M (2021). Bregman-style Online Convex Optimization with EnergyHarvesting Constraints, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 4:3, (1-25), Online publication date: 30-Nov-2020.
- Higuchi K, Tsuchida H, Ohn-Bar E, Sato Y and Kitani K (2020). Learning Context-dependent Personal Preferences for Adaptive Recommendation, ACM Transactions on Interactive Intelligent Systems, 10:3, (1-26), Online publication date: 20-Nov-2020.
- Modaresi S, Sauré D and Vielma J (2020). Learning in Combinatorial Optimization, Operations Research, 68:5, (1585-1604), Online publication date: 1-Sep-2020.
- Dadkhahi H, Shanmugam K, Rios J, Das P, Hoffman S, Loeffler T and Sankaranarayanan S Combinatorial Black-Box Optimization with Expert Advice Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (1918-1927)
- Yuan Z, Guo Z, Yu X, Wang X and Yang T Accelerating Deep Learning with Millions of Classes Computer Vision – ECCV 2020, (711-726)
- Zhao P, Wang D, Wu P and Hoi S (2020). A Unified Framework for Sparse Online Learning, ACM Transactions on Knowledge Discovery from Data, 14:5, (1-20), Online publication date: 21-Aug-2020.
- Berend D, Kontorovich A, Reyzin L and Robinson T (2020). On biased random walks, corrupted intervals, and learning under adversarial design, Annals of Mathematics and Artificial Intelligence, 88:8, (887-905), Online publication date: 1-Aug-2020.
- Morik M, Singh A, Hong J and Joachims T Controlling Fairness and Bias in Dynamic Learning-to-Rank Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval, (429-438)
- Mendonça V, Sardinha A, Coheur L and Santos A Query Strategies, Assemble! Active Learning with Expert Advice for Low-resource Natural Language Processing 2020 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), (1-8)
- Valls V, Iosifidis G, Mel G and Tassiulas L Online Network Flow Optimization for Multi-Grade Service Chains IEEE INFOCOM 2020 - IEEE Conference on Computer Communications, (1329-1338)
- Mansour Y, Slivkins A and Syrgkanis V (2020). Bayesian Incentive-Compatible Bandit Exploration, Operations Research, 68:4, (1132-1161), Online publication date: 1-Jul-2020.
- Uğur Y, Aguerri I and Zaidi A (2020). Vector Gaussian CEO Problem Under Logarithmic Loss and Applications, IEEE Transactions on Information Theory, 66:7, (4183-4202), Online publication date: 1-Jul-2020.
- Alquier P, Bertin K, Doukhan P and Garnier R (2020). High-dimensional VAR with low-rank transition, Statistics and Computing, 30:4, (1139-1153), Online publication date: 1-Jul-2020.
- Feldbacher-Escamilla C and Schurz G (2019). Optimal probability aggregation based on generalized brier scoring, Annals of Mathematics and Artificial Intelligence, 88:7, (717-734), Online publication date: 1-Jul-2020.
- Kalkanlı C and Özgür A An Improved Regret Bound for Thompson Sampling in the Gaussian Linear Bandit Setting 2020 IEEE International Symposium on Information Theory (ISIT), (2783-2788)
- Le Thi H and Ho V (2020). Online Learning Based on Online DCA and Application to Online Classification, Neural Computation, 32:4, (759-793), Online publication date: 1-Apr-2020.
- Zheng Z, Peng Y, Wu F, Tang S and Chen G (2020). ARETE: On Designing Joint Online Pricing and Reward Sharing Mechanisms for Mobile Data Markets, IEEE Transactions on Mobile Computing, 19:4, (769-787), Online publication date: 1-Apr-2020.
- Zhao P, Cai L and Zhou Z (2020). Handling concept drift via model reuse, Machine Language, 109:3, (533-568), Online publication date: 1-Mar-2020.
- Kerr C, Hoare T, Carroll P and Mareček J (2020). Integer programming ensemble of temporal relations classifiers, Data Mining and Knowledge Discovery, 34:2, (533-562), Online publication date: 1-Mar-2020.
- Kotłowski W (2020). Scale-invariant unconstrained online learning, Theoretical Computer Science, 808:C, (139-158), Online publication date: 12-Feb-2020.
- Joulani P, György A and Szepesvári C (2020). A modular analysis of adaptive (non-)convex optimization, Theoretical Computer Science, 808:C, (108-138), Online publication date: 12-Feb-2020.
- He J, Du C, Zhuang F, Yin X, He Q and Long G (2020). Online Bayesian max-margin subspace learning for multi-view classification and regression, Machine Language, 109:2, (219-249), Online publication date: 1-Feb-2020.
- Russo D and Zou J (2019). How Much Does Your Data Exploration Overfit? Controlling Bias via Information Usage, IEEE Transactions on Information Theory, 66:1, (302-323), Online publication date: 1-Jan-2020.
- Gomes A, Macedo D and Vieira L (2020). Automatic MAC protocol selection in wireless networks based on reinforcement learning, Computer Communications, 149:C, (312-323), Online publication date: 1-Jan-2020.
- Lhéritier A and Cazals F Low-complexity nonparametric Bayesian online prediction with universal guarantees Proceedings of the 33rd International Conference on Neural Information Processing Systems, (14581-14590)
- Degenne R, Koolen W and Ménard P Non-asymptotic pure exploration by solving games Proceedings of the 33rd International Conference on Neural Information Processing Systems, (14492-14501)
- Hoeven D User-specified local differential privacy in unconstrained adaptive online learning Proceedings of the 33rd International Conference on Neural Information Processing Systems, (14103-14112)
- Jain L and Jamieson K A new perspective on pool-based active classification and false-discovery control Proceedings of the 33rd International Conference on Neural Information Processing Systems, (14015-14026)
- Sessa P, Bogunovic I, Kamgarpour M and Krause A No-regret learning in unknown games with correlated payoffs Proceedings of the 33rd International Conference on Neural Information Processing Systems, (13624-13633)
- Celli A, Marchesi A, Bianchi T and Gatti N Learning to correlate in multi-player general-sum sequential games Proceedings of the 33rd International Conference on Neural Information Processing Systems, (13076-13086)
- Bailey J and Piliouras G Fast and furious learning in zero-sum games Proceedings of the 33rd International Conference on Neural Information Processing Systems, (12997-13007)
- Joulani P, György A and Szepesvári C Think out of the "Box" Proceedings of the 33rd International Conference on Neural Information Processing Systems, (12246-12256)
- Mhammedi Z, Grünwald P and Guedj B PAC-Bayes un-expected Bernstein inequality Proceedings of the 33rd International Conference on Neural Information Processing Systems, (12202-12213)
- Zimmert J and Lattimore T Connections between mirror descent, thompson sampling and the information ratio Proceedings of the 33rd International Conference on Neural Information Processing Systems, (11973-11982)
- Levy D and Duchi J Necessary and sufficient geometries for gradient methods Proceedings of the 33rd International Conference on Neural Information Processing Systems, (11495-11505)
- Agarwal N, Hazan E and Singh K Logarithmic regret for online control Proceedings of the 33rd International Conference on Neural Information Processing Systems, (10175-10184)
- Shayestehmanesh H, Azami S and Mehta N Dying experts Proceedings of the 33rd International Conference on Neural Information Processing Systems, (9983-9992)
- Jézéquell R, Gaillard P and Rudi A Efficient online learning with kernels for adversarial large scale problems Proceedings of the 33rd International Conference on Neural Information Processing Systems, (9432-9441)
- Abernethy J, Jung Y, Lee C, McMillan A and Tewari A Online learning via the differential privacy lens Proceedings of the 33rd International Conference on Neural Information Processing Systems, (8894-8904)
- Gonen A, Hazan E and Moran S Private learning implies online learning Proceedings of the 33rd International Conference on Neural Information Processing Systems, (8702-8712)
- Herbster M and Robinson J Online prediction of switching graph labelings with cluster specialists Proceedings of the 33rd International Conference on Neural Information Processing Systems, (7004-7014)
- Wang Q, Li Y, Xiong J and Zhang T Divergence-augmented policy optimization Proceedings of the 33rd International Conference on Neural Information Processing Systems, (6099-6110)
- Bar-On Y and Mansour Y Individual regret in cooperative nonstochastic multi-armed bandits Proceedings of the 33rd International Conference on Neural Information Processing Systems, (3116-3126)
- Cardoso A, Wang H and Xu H Large scale Markov decision processes with changing rewards Proceedings of the 33rd International Conference on Neural Information Processing Systems, (2340-2350)
- Rosenberg A and Mansour Y Online stochastic shortest path with bandit feedback and unknown transition function Proceedings of the 33rd International Conference on Neural Information Processing Systems, (2212-2221)
- Nayman N, Noy A, Ridnik T, Friedman I, Jin R and Zelnik-Manor L XNAS Proceedings of the 33rd International Conference on Neural Information Processing Systems, (1977-1987)
- Lee H, Mangoubi O and Vishnoi N Online sampling from log-concave distributions Proceedings of the 33rd International Conference on Neural Information Processing Systems, (1228-1239)
- Nakamura A, Helmbold D and Warmuth M (2019). Mistake bounds on the noise-free multi-armed bandit game, Information and Computation, 269:C, Online publication date: 1-Dec-2019.
- Liao S and Zhang X Online Kernel Selection via Tensor Sketching Proceedings of the 28th ACM International Conference on Information and Knowledge Management, (801-810)
- Burgess M, Chapman A and Scott P An Engineered Empirical Bernstein Bound Machine Learning and Knowledge Discovery in Databases, (86-102)
- Frigó E and Kocsis L Online ranking combination Proceedings of the 13th ACM Conference on Recommender Systems, (12-19)
- Kleinberg R, Slivkins A and Upfal E (2019). Bandits and Experts in Metric Spaces, Journal of the ACM, 66:4, (1-77), Online publication date: 26-Aug-2019.
- Sharafzadeh E, Kohroudi S, Asyabi E and Sharifi M Yawn Proceedings of the 10th ACM SIGOPS Asia-Pacific Workshop on Systems, (91-98)
- Parhizkar E, Nikravan M and Zilles S Indirect trust is simple to establish Proceedings of the 28th International Joint Conference on Artificial Intelligence, (3216-3222)
- Li C and De Rijke M Cascading non-stationary bandits Proceedings of the 28th International Joint Conference on Artificial Intelligence, (2859-2865)
- He Y, Wu B, Wu D, Beyazit E, Chen S and Wu X Online learning from capricious data streams Proceedings of the 28th International Joint Conference on Artificial Intelligence, (2491-2497)
- Yu H and Neely M (2019). Learning-Aided Optimization for Energy-Harvesting Devices With Outdated State Information, IEEE/ACM Transactions on Networking, 27:4, (1501-1514), Online publication date: 1-Aug-2019.
- Cautis B, Maniu S and Tziortziotis N Adaptive Influence Maximization Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (3185-3186)
- Estella Aguerri I, Zaidi A, Caire G and Shamai Shitz S (2019). On the Capacity of Cloud Radio Access Networks With Oblivious Relaying, IEEE Transactions on Information Theory, 65:7, (4575-4596), Online publication date: 1-Jul-2019.
- Cabannes T, Sangiovanni M, Keimer A and Bayen A (2019). Regrets in Routing Networks, ACM Transactions on Spatial Algorithms and Systems, 5:2, (1-19), Online publication date: 30-Jun-2019.
- Cohen L and Mansour Y Optimal Algorithm for Bayesian Incentive-Compatible Exploration Proceedings of the 2019 ACM Conference on Economics and Computation, (135-151)
- O’Neill S, Bagdasar O and Liotta A An Online Learning Approach to a Multi-player N-armed Functional Bandit Numerical Computations: Theory and Algorithms, (438-445)
- Wu H, Yan Y, Ye Y, Min H, Ng M and Wu Q (2019). Online Heterogeneous Transfer Learning by Knowledge Transition, ACM Transactions on Intelligent Systems and Technology, 10:3, (1-19), Online publication date: 31-May-2019.
- Kuskonmaz B, Ozkan H and Gurbuz O (2019). Machine learning based smart steering for wireless mesh networks, Ad Hoc Networks, 88:C, (98-111), Online publication date: 15-May-2019.
- Immorlica N, Mao J, Slivkins A and Wu Z Bayesian Exploration with Heterogeneous Agents The World Wide Web Conference, (751-761)
- Celli A, Coniglio S and Gatti N Computing Optimal Ex Ante Correlated Equilibria in Two-Player Sequential Games Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, (909-917)
- Bailey J and Piliouras G Multi-Agent Learning in Network Zero-Sum Games is a Hamiltonian System Proceedings of the 18th International Conference on Autonomous Agents and MultiAgent Systems, (233-241)
- Ernala S, Birnbaum M, Candan K, Rizvi A, Sterling W, Kane J and De Choudhury M Methodological Gaps in Predicting Mental Health States from Social Media Proceedings of the 2019 CHI Conference on Human Factors in Computing Systems, (1-16)
- Lardeux F, Maturana J, Rodriguez-Tello E and Saubion F (2019). Migration policies in dynamic island models, Natural Computing: an international journal, 18:1, (163-179), Online publication date: 1-Mar-2019.
- V'yugin V and Trunov V (2019). Online aggregation of unbounded losses using shifting experts with confidence, Machine Language, 108:3, (425-444), Online publication date: 1-Mar-2019.
- Sahoo D, Hoi S and Li B (2019). Large Scale Online Multiple Kernel Regression with Application to Time-Series Prediction, ACM Transactions on Knowledge Discovery from Data, 13:1, (1-33), Online publication date: 28-Feb-2019.
- Yun D, Ahn S, Proutiere A, Shin J and Yi Y (2018). Multi-armed Bandit with Additional Observations, ACM SIGMETRICS Performance Evaluation Review, 46:1, (53-55), Online publication date: 17-Jan-2019.
- Mourtada J and Gaïffas S (2021). On the optimality of the Hedge algorithm in the stochastic regime, The Journal of Machine Learning Research, 20:1, (3004-3031), Online publication date: 1-Jan-2019.
- Shen Y, Chen T and Giannakis G (2019). Random feature-based online multi-kernel learning in environments with unknown dynamics, The Journal of Machine Learning Research, 20:1, (773-808), Online publication date: 1-Jan-2019.
- Borrero J, Prokopyev O and Sauré D (2019). Sequential Interdiction with Incomplete Information and Learning, Operations Research, 67:1, (72-89), Online publication date: 1-Jan-2019.
- Gaillard P and Wintenberger O Efficient online algorithms for fast-rate regret bounds under sparsity Proceedings of the 32nd International Conference on Neural Information Processing Systems, (7026-7036)
- Han Y, Jiao J, Lee C, Weissman T, Wu Y and Yu T Entropy rate estimation for Markov chains with large state space Proceedings of the 32nd International Conference on Neural Information Processing Systems, (9803-9814)
- Daskalakis C and Panageas I The limit points of (optimistic) gradient descent in min-max optimization Proceedings of the 32nd International Conference on Neural Information Processing Systems, (9256-9266)
- Huang J, Wu F, Precup D and Cai Y Learning safe policies with expert guidance Proceedings of the 32nd International Conference on Neural Information Processing Systems, (9123-9132)
- Yuan J and Lamperski A Online convex optimization for cumulative constraints Proceedings of the 32nd International Conference on Neural Information Processing Systems, (6140-6149)
- Hazan E, Hu W, Li Y and Li Z Online improper learning with an approximation oracle Proceedings of the 32nd International Conference on Neural Information Processing Systems, (5657-5665)
- Zhou Z, Mertikopoulos P, Athey S, Bambos N, Glynn P and Ye Y Learning in games with lossy feedback Proceedings of the 32nd International Conference on Neural Information Processing Systems, (5140-5150)
- Hazan E, Lee H, Singh K, Zhang C and Zhang Y Spectral filtering for general linear dynamical systems Proceedings of the 32nd International Conference on Neural Information Processing Systems, (4639-4648)
- Thune T and Seldin Y Adaptation to easy data in prediction with limited advice Proceedings of the 32nd International Conference on Neural Information Processing Systems, (2914-2923)
- Foster D and Krishnamurthy A Contextual bandits with surrogate losses Proceedings of the 32nd International Conference on Neural Information Processing Systems, (2626-2637)
- Zhang L, Lu S and Zhou Z Adaptive online learning in dynamic environments Proceedings of the 32nd International Conference on Neural Information Processing Systems, (1330-1340)
- Truong A, Etesami S and Kiyavash N (2018). Learning From Sleeping Experts, ACM Transactions on Design Automation of Electronic Systems, 23:6, (1-18), Online publication date: 30-Nov-2018.
- Ugur Y, Aguerri I and Zaidi A Vector Gaussian CEO Problem Under Logarithmic Loss 2018 IEEE Information Theory Workshop (ITW), (1-5)
- Ho-Nguyen N and Kılınç-Karzan F (2018). Online First-Order Framework for Robust Convex Optimization, Operations Research, 66:6, (1670-1692), Online publication date: 1-Nov-2018.
- Hou C and Zhou Z (2018). One-Pass Learning with Incremental and Decremental Features, IEEE Transactions on Pattern Analysis and Machine Intelligence, 40:11, (2776-2792), Online publication date: 1-Nov-2018.
- Hao S, Hu P, Zhao P, Hoi S and Miao C (2018). Online Active Learning with Expert Advice, ACM Transactions on Knowledge Discovery from Data, 12:5, (1-22), Online publication date: 31-Oct-2018.
- Kari D, Mirza A, Khan F, Ozkan H and Kozat S (2018). Boosted adaptive filters, Digital Signal Processing, 81:C, (61-78), Online publication date: 1-Oct-2018.
- Huang D, Yu S, Li B, Hoi S and Zhou S (2018). Combination Forecasting Reversion Strategy for Online Portfolio Selection, ACM Transactions on Intelligent Systems and Technology, 9:5, (1-22), Online publication date: 30-Sep-2018.
- Jauvion G, Grislain N, Dkengne Sielenou P, Garivier A and Gerchinovitz S Optimization of a SSP's Header Bidding Strategy using Thompson Sampling Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (425-432)
- Sato I, Nomura Y, Hanaoka S, Miki S, Hayashi N, Abe O and Masutani Y Managing Computer-Assisted Detection System Based on Transfer Learning with Negative Transfer Inhibition Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, (695-704)
- Wang G, Zhao D and Zhang L Minimizing adaptive regret with one gradient per iteration Proceedings of the 27th International Joint Conference on Artificial Intelligence, (2762-2768)
- Sahoo D, Pham Q, Lu J and Hoi S Online deep learning Proceedings of the 27th International Joint Conference on Artificial Intelligence, (2660-2666)
- Sui Y, Zoghi M, Hofmann K and Yue Y Advancements in dueling bandits Proceedings of the 27th International Joint Conference on Artificial Intelligence, (5502-5510)
- Balcan M, Blum A and Chen S Diversified Strategies for Mitigating Adversarial Attacks in Multiagent Systems Proceedings of the 17th International Conference on Autonomous Agents and MultiAgent Systems, (407-415)
- Sharan V, Kakade S, Liang P and Valiant G Prediction with a short memory Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, (1074-1087)
- Lykouris T, Mirrokni V and Paes Leme R Stochastic bandits robust to adversarial corruptions Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, (114-122)
- Feng Z and Loh P Online Learning with Graph-Structured Feedback against Adaptive Adversaries 2018 IEEE International Symposium on Information Theory (ISIT), (931-935)
- Yun D, Ahn S, Proutiere A, Shin J and Yi Y Multi-armed Bandit with Additional Observations Abstracts of the 2018 ACM International Conference on Measurement and Modeling of Computer Systems, (53-55)
- Feng Z, Podimata C and Syrgkanis V Learning to Bid Without Knowing your Value Proceedings of the 2018 ACM Conference on Economics and Computation, (505-522)
- Han S, Li X, Yan L, Liu Z and Guan X (2018). Game-based hierarchical multi-armed bandit learning algorithm for joint channel and power allocation in underwater acoustic communication networks, Neurocomputing, 289:C, (166-179), Online publication date: 10-May-2018.
- Shen Y, Chen T and Giannakis G Online Multi-Kernel Learning with Orthogonal Random Features 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), (6289-6293)
- Yun D, Proutiere A, Ahn S, Shin J and Yi Y (2018). Multi-armed Bandit with Additional Observations, Proceedings of the ACM on Measurement and Analysis of Computing Systems, 2:1, (1-22), Online publication date: 3-Apr-2018.
- Deng H, Hou I, Hou I and Deng H (2018). Optimal Capacity Provisioning for Online Job Allocation With Hard Allocation Ratio Requirement, IEEE/ACM Transactions on Networking, 26:2, (724-736), Online publication date: 1-Apr-2018.
- Krichene W, Bourguiba M, Tlam K and Bayen A (2018). On Learning How Players Learn, ACM Transactions on Cyber-Physical Systems, 2:1, (1-23), Online publication date: 23-Feb-2018.
- Ghaderzadeh A, Kargahi M and Reshadi M (2018). ReDePoly, Telecommunications Systems, 67:2, (231-246), Online publication date: 1-Feb-2018.
- Losing V, Hammer B and Wersing H (2018). Incremental on-line learning, Neurocomputing, 275:C, (1261-1274), Online publication date: 31-Jan-2018.
- Mertikopoulos P, Papadimitriou C and Piliouras G Cycles in adversarial regularized learning Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, (2703-2717)
- Dereziński M and Warmuth M (2018). Reverse iterative volume sampling for linear regression, The Journal of Machine Learning Research, 19:1, (853-891), Online publication date: 1-Jan-2018.
- Zhou Z, Mertikopoulos P, Moustakas A, Bambos N and Glynn P Mirror descent learning in continuous games 2017 IEEE 56th Annual Conference on Decision and Control (CDC), (5776-5783)
- Abernethy J and Wang J On frank-wolfe and equilibrium computation Proceedings of the 31st International Conference on Neural Information Processing Systems, (6587-6596)
- Zhou Z, Mertikopoulos P, Bambos N, Glynn P and Tomlin C Countering feedback delays in multi-agent learning Proceedings of the 31st International Conference on Neural Information Processing Systems, (6172-6182)
- Foster D, Kale S, Mohri M and Sridharan K Parameter-free online learning via model selection Proceedings of the 31st International Conference on Neural Information Processing Systems, (6022-6032)
- Palaiopanos G, Panageas I and Piliouras G Multiplicative weights update with constant step-size in congestion games Proceedings of the 31st International Conference on Neural Information Processing Systems, (5874-5884)
- Dekel O, Flajolet A, Haghtalab N and Jaillet P Online learning with a hint Proceedings of the 31st International Conference on Neural Information Processing Systems, (5305-5314)
- Mohri M and Yang S Online learning with transductive regret Proceedings of the 31st International Conference on Neural Information Processing Systems, (5220-5230)
- Kotłowski W, Koolen W and Malek A Random permutation online isotonic regression Proceedings of the 31st International Conference on Neural Information Processing Systems, (4183-4192)
- Uziel G and El-Yaniv R Multi-objective non-parametric sequential prediction Proceedings of the 31st International Conference on Neural Information Processing Systems, (3374-3383)
- Dereziński M and Warmuth M Unbiased estimates for linear regression via volume sampling Proceedings of the 31st International Conference on Neural Information Processing Systems, (3087-3096)
- Levine N, Crammer K and Mannor S Rotting Bandits Proceedings of the 31st International Conference on Neural Information Processing Systems, (3077-3086)
- Abbasi-Yadkori Y, Bartlett P and Gabillon V Near minimax optimal players for the finite-time 3-expert prediction problem Proceedings of the 31st International Conference on Neural Information Processing Systems, (3037-3045)
- Berthet Q and Perchet V Fast rates for bandit optimization with Upper-Confidence Frank-Wolfe Proceedings of the 31st International Conference on Neural Information Processing Systems, (2222-2231)
- Altschuler J, Weed J and Rigollet P Near-linear time approximation algorithms for optimal transport via Sinkhorn iteration Proceedings of the 31st International Conference on Neural Information Processing Systems, (1961-1971)
- Yu H, Neely M and Wei X Online convex optimization with stochastic constraints Proceedings of the 31st International Conference on Neural Information Processing Systems, (1427-1437)
- Hou B, Zhang L and Zhou Z Learning with feature evolvable streams Proceedings of the 31st International Conference on Neural Information Processing Systems, (1416-1426)
- Yan S and Zhang C Revisiting perceptron Proceedings of the 31st International Conference on Neural Information Processing Systems, (1056-1066)
- Jung Y, Goetz J and Tewari A Online multiclass boosting Proceedings of the 31st International Conference on Neural Information Processing Systems, (920-929)
- Schapira M and Winstein K Congestion-Control Throwdown Proceedings of the 16th ACM Workshop on Hot Topics in Networks, (122-128)
- Uğur Y, Aguerri I and Zaidi A A generalization of blahut-arimoto algorithm to compute rate-distortion regions of multiterminal source coding under logarithmic loss 2017 IEEE Information Theory Workshop (ITW), (349-353)
- Greenewald K, Kelley S, Oselio B and Hero A (2017). Similarity Function Tracking Using Pairwise Comparisons, IEEE Transactions on Signal Processing, 65:21, (5635-5648), Online publication date: 1-Nov-2017.
- Gundogdu E, Ozkan H and Alatan A (2017). Extending Correlation Filter-Based Visual Tracking by Tree-Structured Ensemble and Spatial Windowing, IEEE Transactions on Image Processing, 26:11, (5270-5283), Online publication date: 1-Nov-2017.
- Hedayati F and Bartlett P (2017). Exchangeability Characterizes Optimality of Sequential Normalized Maximum Likelihood and Bayesian Prediction, IEEE Transactions on Information Theory, 63:10, (6767-6773), Online publication date: 1-Oct-2017.
- Ottens B, Dimitrakakis C and Faltings B (2017). DUCT, ACM Transactions on Intelligent Systems and Technology, 8:5, (1-27), Online publication date: 30-Sep-2017.
- Soriano Marcolino L, Lakshminarayanan A, Nagarajan V and Tambe M (2017). Every team deserves a second chance, Autonomous Agents and Multi-Agent Systems, 31:5, (1003-1054), Online publication date: 1-Sep-2017.
- Guo Q, An B and Tran-Thanh L Playing repeated network interdiction games with semi-bandit feedback Proceedings of the 26th International Joint Conference on Artificial Intelligence, (3682-3690)
- Zheng S and Kwok J Follow the moving leader in deep learning Proceedings of the 34th International Conference on Machine Learning - Volume 70, (4110-4119)
- Sun W, Dey D and Kapoor A Safety-aware algorithms for adversarial contextual bandit Proceedings of the 34th International Conference on Machine Learning - Volume 70, (3280-3288)
- Namkoong H, Sinha A, Yadlowsky S and Duchi J Adaptive sampling probabilities for non-smooth optimization Proceedings of the 34th International Conference on Machine Learning - Volume 70, (2574-2583)
- Kale S, Karnin Z, Liang T and Pál D Adaptive feature selection Proceedings of the 34th International Conference on Machine Learning - Volume 70, (1780-1788)
- Hazan E, Singh K and Zhang C Efficient regret minimization in non-convex games Proceedings of the 34th International Conference on Machine Learning - Volume 70, (1433-1441)
- Farina G, Kroer C and Sandholm T Regret minimization in behaviorally-constrained zero-sum games Proceedings of the 34th International Conference on Machine Learning - Volume 70, (1107-1116)
- Beygelzimer A, Orabona F and Zhang C Efficient online bandit multiclass learning with Õ(√T) regret Proceedings of the 34th International Conference on Machine Learning - Volume 70, (488-497)
- Azar M, Osband I and Munos R Minimax regret bounds for reinforcement learning Proceedings of the 34th International Conference on Machine Learning - Volume 70, (263-272)
- Allen-Zhu Z and Li Y Follow the compressed leader Proceedings of the 34th International Conference on Machine Learning - Volume 70, (116-125)
- Marchant N and Rubinstein B (2017). In search of an entity resolution OASIS, Proceedings of the VLDB Endowment, 10:11, (1322-1333), Online publication date: 1-Aug-2017.
- Civek B, Delibalta I and Kozat S (2017). Highly efficient hierarchical online nonlinear regression using second order methods, Signal Processing, 137:C, (22-32), Online publication date: 1-Aug-2017.
- Chawla S, Devanur N, Kulkarni J and Niazadeh R Truth and Regret in Online Scheduling Proceedings of the 2017 ACM Conference on Economics and Computation, (423-440)
- Arieli I and Babichenko Y Simple Approximate Equilibria in Games with Many Players Proceedings of the 2017 ACM Conference on Economics and Computation, (681-691)
- Arieli I, Babichenko Y and Smorodinsky R Forecast Aggregation Proceedings of the 2017 ACM Conference on Economics and Computation, (61-62)
- Syrgkanis V Fast convergence of learning in games (invited talk) Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, (5-5)
- Mendonça V, Melo F, Coheur L and Sardinha A A Conversational Agent Powered by Online Learning Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, (1637-1639)
- Ramos G, da Silva B and Bazzan A Learning to Minimise Regret in Route Choice Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, (846-855)
- Mertikopoulos P, Belmega E, Negrel R and Sanguinetti L (2017). Distributed Stochastic Optimization via Matrix Exponential Learning, IEEE Transactions on Signal Processing, 65:9, (2277-2290), Online publication date: 1-May-2017.
- Maghsudi S and Hossain E (2017). Distributed User Association in Energy Harvesting Small Cell Networks, IEEE Transactions on Wireless Communications, 16:3, (1549-1563), Online publication date: 1-Mar-2017.
- Kuleshov V and Ermon S Estimating uncertainty online against an adversary Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (2110-2116)
- Xu J, Han Y, Marcu D and Schaar M Progressive prediction of student performance in college programs Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (1604-1610)
- Brown N, Kroer C and Sandholm T Dynamic thresholding and pruning for regret minimization Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, (421-429)
- Molinaro M Online and random-order load balancing simultaneously Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, (1638-1650)
- Van Rooyen B and Williamson R (2017). A theory of learning with corrupted labels, The Journal of Machine Learning Research, 18:1, (8501-8550), Online publication date: 1-Jan-2017.
- Huang R, Lattimore T, György A and Szepesvári C (2017). Following the leader and fast rates in online linear prediction, The Journal of Machine Learning Research, 18:1, (5325-5355), Online publication date: 1-Jan-2017.
- Narayanan H and Rakhlin A (2017). Efficient sampling from time-varying log-concave distributions, The Journal of Machine Learning Research, 18:1, (4017-4045), Online publication date: 1-Jan-2017.
- McMahan H (2017). A survey of algorithms and analysis for adaptive online learning, The Journal of Machine Learning Research, 18:1, (3117-3166), Online publication date: 1-Jan-2017.
- Bardenet R, Doucet A and Holmes C (2017). On Markov chain Monte Carlo methods for tall data, The Journal of Machine Learning Research, 18:1, (1515-1557), Online publication date: 1-Jan-2017.
- McDonald D, Shalizi C and Schervish M (2017). Nonparametric risk bounds for time-series forecasting, The Journal of Machine Learning Research, 18:1, (1044-1083), Online publication date: 1-Jan-2017.
- Dimitrakakis C and Mitrokotsa A (2017). Near-optimal blacklisting, Computers and Security, 64:C, (110-121), Online publication date: 1-Jan-2017.
- Huang R, Lattimore T, György A and Szepesvári C Following the leader and fast rates in linear prediction Proceedings of the 30th International Conference on Neural Information Processing Systems, (4976-4984)
- Abernethy J, Amin K and Zhu R Threshold bandit, with and without censored feedback Proceedings of the 30th International Conference on Neural Information Processing Systems, (4896-4904)
- Foster D, Li Z, Lykouris T, Sridharan K and Tardos É Learning in games Proceedings of the 30th International Conference on Neural Information Processing Systems, (4734-4742)
- Koolen W, Grünwald P and van Erven T Combining adversarial guarantees and stochastic fast rates in online learning Proceedings of the 30th International Conference on Neural Information Processing Systems, (4464-4472)
- Wei C, Hong Y and Lu C Tracking the best expert in non-stationary stochastic environments Proceedings of the 30th International Conference on Neural Information Processing Systems, (3979-3987)
- Milan K, Veness J, Kirkpatrick J, Hassabis D, Koop A and Bowling M The Forget-me-not Process Proceedings of the 30th International Conference on Neural Information Processing Systems, (3709-3717)
- Namkoong H and Duchi J Stochastic gradient methods for distributionally robust optimization with f-divergences Proceedings of the 30th International Conference on Neural Information Processing Systems, (2216-2224)
- Kale S, Lee C and Pál D Hardness of online sleeping combinatorial optimization problems Proceedings of the 30th International Conference on Neural Information Processing Systems, (2189-2197)
- Schuurmans D and Zinkevich M Deep learning games Proceedings of the 30th International Conference on Neural Information Processing Systems, (1686-1694)
- Allen-Zhu Z, Yuan Y and Sridharan K Exploiting the structure Proceedings of the 30th International Conference on Neural Information Processing Systems, (1650-1658)
- Zhao S, Zhou E, Sabharwal A and Ermon S Adaptive concentration inequalities for sequential decision problems Proceedings of the 30th International Conference on Neural Information Processing Systems, (1351-1359)
- Luo H, Agarwal A, Cesa-Bianchi N and Langford J Efficient second order online learning by sketching Proceedings of the 30th International Conference on Neural Information Processing Systems, (910-918)
- Orabona F and Pál D Coin betting and parameter-free online learning Proceedings of the 30th International Conference on Neural Information Processing Systems, (577-585)
- Balandat M, Krichene W, Tomlin C and Bayen A Minimizing regret on reflexive Banach spaces and nash equilibria in continuous zero-sum games Proceedings of the 30th International Conference on Neural Information Processing Systems, (154-162)
- Nock R, Menon A and Ong C A scaled Bregman theorem with applications Proceedings of the 30th International Conference on Neural Information Processing Systems, (19-27)
- Vanli N, Gokcesu K, Sayin M, Yildiz H and Kozat S (2016). Sequential Prediction Over Hierarchical Structures, IEEE Transactions on Signal Processing, 64:23, (6284-6298), Online publication date: 1-Dec-2016.
- Le T and Clarke B (2016). Using the Bayesian Shtarkov solution for predictions, Computational Statistics & Data Analysis, 104:C, (183-196), Online publication date: 1-Dec-2016.
- Al-Dujaili A, Suresh S and Sundararajan N (2016). MSO, Journal of Global Optimization, 66:4, (811-845), Online publication date: 1-Dec-2016.
- Liu C, Hoi S, Zhao P, Sun J and Lim E Online Adaptive Passive-Aggressive Methods for Non-Negative Matrix Factorization and Its Applications Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, (1161-1170)
- Kantarcioglu M and Xi B Adversarial Data Mining Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, (1866-1867)
- Zhang Y and Yang X (2016). Online ordering policies for a two-product, multi-period stationary newsvendor problem, Computers and Operations Research, 74:C, (143-151), Online publication date: 1-Oct-2016.
- Geilke M, Karwath A and Kramer S Online Density Estimation of Heterogeneous Data Streams in Higher Dimensions European Conference on Machine Learning and Knowledge Discovery in Databases - Volume 9851, (65-80)
- Zhang X, Yang T and Srinivasan P Online Asymmetric Active Learning with Imbalanced Data Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (2055-2064)
- Hazan E (2016). Introduction to Online Convex Optimization, Foundations and Trends in Optimization, 2:3-4, (157-325), Online publication date: 1-Aug-2016.
- Ozkan H, Vanli N and Kozat S (2016). Online Classification via Self-Organizing Space Partitioning, IEEE Transactions on Signal Processing, 64:15, (3895-3908), Online publication date: 1-Aug-2016.
- Roughgarden T and Wang J Minimizing Regret with Multiple Reserves Proceedings of the 2016 ACM Conference on Economics and Computation, (601-616)
- Panageas I and Piliouras G Average Case Performance of Replicator Dynamics in Potential Games via Computing Regions of Attraction Proceedings of the 2016 ACM Conference on Economics and Computation, (703-720)
- Biswas A, Gopalakrishnan R and Dutta P Managing overstaying electric vehicles in park-and-charge facilities Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (2465-24711)
- He J, Du C, Zhuang F, Yin X, He Q and Long G Online Bayesian max-margin subspace multi-view learning Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, (1555-1561)
- Abraham I, Alonso O, Kandylas V, Patel R, Shelford S and Slivkins A How Many Workers to Ask? Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval, (473-482)
- Hassan M, Hossain M and Bhargava V (2016). Distributed Beamforming and Autonomous Participation Decision Making in Cooperative CR Systems in Presence of Asynchronous Interference, IEEE Transactions on Wireless Communications, 15:7, (5016-5029), Online publication date: 1-Jul-2016.
- van Ommen T, Koolen W, Feenstra T and Grünwald P (2016). Robust probability updating, International Journal of Approximate Reasoning, 74:C, (30-57), Online publication date: 1-Jul-2016.
- (2016). One-pass AUC optimization, Artificial Intelligence, 236:C, (1-29), Online publication date: 1-Jul-2016.
- Garber D and Hazan E (2016). Sublinear time algorithms for approximate semidefinite programming, Mathematical Programming: Series A and B, 158:1-2, (329-361), Online publication date: 1-Jul-2016.
- McQuade S and Monteleoni C Online Learning of Volatility from Multiple Option Term Lengths Proceedings of the Second International Workshop on Data Science for Macro-Modeling, (1-3)
- Koriche F Online forest density estimation Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, (357-366)
- Kocák T, Neu G and Valko M Online learning with Erdős-Rényi side-observation graphs Proceedings of the Thirty-Second Conference on Uncertainty in Artificial Intelligence, (339-346)
- Hazan E and Koren T The computational power of optimization in online learning Proceedings of the forty-eighth annual ACM symposium on Theory of Computing, (128-141)
- Raginsky M and Nedić A (2016). Online Discrete Optimization in Social Networks in the Presence of Knightian Uncertainty, Operations Research, 64:3, (662-679), Online publication date: 1-Jun-2016.
- Han K, Zhang C and Luo J (2016). Taming the uncertainty, IEEE/ACM Transactions on Networking, 24:3, (1462-1475), Online publication date: 1-Jun-2016.
- Xu H, Tran-Thanh L and Jennings N Playing Repeated Security Games with No Prior Knowledge Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems, (104-112)
- Lam K, Krichene W and Bayen A On learning how players learn Proceedings of the 7th International Conference on Cyber-Physical Systems, (1-10)
- Frías-Blanco I, Verdecia-Cabrera A, Ortiz-Díaz A and Carvalho A Fast adaptive stacking of ensembles Proceedings of the 31st Annual ACM Symposium on Applied Computing, (929-934)
- Mertikopoulos P and Belmega E (2016). Learning to Be Green: Robust Energy Efficiency Maximization in Dynamic MIMO–OFDM Systems, IEEE Journal on Selected Areas in Communications, 34:4, (743-757), Online publication date: 1-Apr-2016.
- Xu J, Wang Q, Zeng K, Liu M and Liu W (2016). Sniffer Channel Assignment With Imperfect Monitoring for Cognitive Radio Networks, IEEE Transactions on Wireless Communications, 15:3, (1703-1715), Online publication date: 1-Mar-2016.
- Brun O, Wang L and Gelenbe E (2016). Big Data for Autonomic Intercontinental Overlays, IEEE Journal on Selected Areas in Communications, 34:3, (575-583), Online publication date: 1-Mar-2016.
- Zhang L, Yang T, Yi J, Jin R and Zhou Z Stochastic optimization for kernel PCA Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (2316-2322)
- Tan M, Yan Y, Wang L, Hengel A, Tsang I and Shi Q Learning sparse confidence-weighted classifier on very high dimensional data Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (2080-2086)
- Joulani P, György A and Szepesvári C Delay-tolerant online convex optimization Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, (1744-1750)
- Gupta R and Roughgarden T A PAC Approach to Application-Specific Algorithm Selection Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, (123-134)
- Gravin N, Peres Y and Sivan B Towards optimal algorithms for prediction with expert advice Proceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms, (528-547)
- Quinn C, Kiyavash N and Coleman T (2015). Directed Information Graphs, IEEE Transactions on Information Theory, 61:12, (6887-6909), Online publication date: 1-Dec-2015.
- Gaussier E, Glesser D, Reis V and Trystram D Improving backfilling by using machine learning to predict running times Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis, (1-10)
- Roughgarden T (2015). Intrinsic Robustness of the Price of Anarchy, Journal of the ACM, 62:5, (1-42), Online publication date: 2-Nov-2015.
- Bubeck S (2015). Convex Optimization, Foundations and Trends® in Machine Learning, 8:3-4, (231-357), Online publication date: 1-Nov-2015.
- Zhu S, Shi Z, Sun C and Shen S (2015). Deep neural network based image annotation, Pattern Recognition Letters, 65:C, (103-108), Online publication date: 1-Nov-2015.
- Fujita T, Hatano K, Kijima S and Takimoto E Online Linear Optimization for Job Scheduling Under Precedence Constraints Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (332-346)
- Orabona F and Pál D Scale-Free Algorithms for Online Linear Optimization Proceedings of the 26th International Conference on Algorithmic Learning Theory - Volume 9355, (287-301)
- Jiantao Jiao , Courtade T, Venkat K and Weissman T (2015). Justification of Logarithmic Loss via the Benefit of Side Information, IEEE Transactions on Information Theory, 61:10, (5357-5365), Online publication date: 1-Oct-2015.
- Amarilli A, Maniu S and Senellart P (2015). Intensional data on the web, ACM SIGWEB Newsletter, 2015:Summer, (1-12), Online publication date: 17-Aug-2015.
- Ikonomovska E, Jafarpour S and Dasdan A Real-Time Bid Prediction using Thompson Sampling-Based Expert Selection Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (1869-1878)
- Johnson N and Banerjee A Structured Hedging for Resource Allocations with Leverage Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (477-486)
- Lei S, Maniu S, Mo L, Cheng R and Senellart P Online Influence Maximization Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, (645-654)
- Tran-Thanh L, Xia Y, Qin T and Jennings N Efficient algorithms with performance guarantees for the stochastic multiple-choice Knapsack problem Proceedings of the 24th International Conference on Artificial Intelligence, (403-409)
- Belluz J, Gaudesi M, Squillero G and Tonda A Operator Selection using Improved Dynamic Multi-Armed Bandit Proceedings of the 2015 Annual Conference on Genetic and Evolutionary Computation, (1311-1317)
- Devroye L, Lugosi G and Neu G (2015). Random-Walk Perturbations for Online Combinatorial Optimization, IEEE Transactions on Information Theory, 61:7, (4099-4106), Online publication date: 1-Jul-2015.
- Abernethy J, Chen Y, Ho C and Waggoner B Low-Cost Learning via Active Data Procurement Proceedings of the Sixteenth ACM Conference on Economics and Computation, (619-636)
- Allen-Zhu Z, Liao Z and Orecchia L Spectral Sparsification and Regret Minimization Beyond Matrix Multiplicative Updates Proceedings of the forty-seventh annual ACM symposium on Theory of Computing, (237-245)
- Chen P and Lu C Playing Congestion Games with Bandit Feedbacks Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, (1721-1722)
- Brown N, Ganzfried S and Sandholm T Hierarchical Abstraction, Distributed Equilibrium Computation, and Post-Processing, with Application to a Champion No-Limit Texas Hold'em Agent Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, (7-15)
- Zhang S, Zhou H, Yao H, Zhang Y, Wang K and Zhang J (2015). Adaptive NormalHedge for robust visual tracking, Signal Processing, 110:C, (132-142), Online publication date: 1-May-2015.
- Babaioff M, Dughmi S, Kleinberg R and Slivkins A (2015). Dynamic Pricing with Limited Supply, ACM Transactions on Economics and Computation, 3:1, (1-26), Online publication date: 27-Mar-2015.
- Leite I (2015). Long-term interactions with empathic social robots, AI Matters, 1:3, (13-15), Online publication date: 10-Mar-2015.
- Maghsudi S and Stanczak S (2015). Channel Selection for Network-Assisted D2D Communication via No-Regret Bandit Learning With Calibrated Forecasting, IEEE Transactions on Wireless Communications, 14:3, (1309-1322), Online publication date: 1-Mar-2015.
- Daniely A, Sabato S, Ben-David S and Shalev-Shwartz S (2015). Multiclass learnability and the ERM principle, The Journal of Machine Learning Research, 16:1, (2377-2404), Online publication date: 1-Jan-2015.
- Santhanam N and Anantharam V (2015). Agnostic insurability of model classes, The Journal of Machine Learning Research, 16:1, (2329-2355), Online publication date: 1-Jan-2015.
- Carpentier A, Munos R and Antos A (2015). Adaptive strategy for stratified Monte Carlo sampling, The Journal of Machine Learning Research, 16:1, (2231-2271), Online publication date: 1-Jan-2015.
- Gammerman A and Vovk V (2015). Alexey Chervonenkis's bibliography, The Journal of Machine Learning Research, 16:1, (2051-2066), Online publication date: 1-Jan-2015.
- Van Erven T, Grünwald P, Mehta N, Reid M and Williamson R (2015). Fast rates in statistical and online learning, The Journal of Machine Learning Research, 16:1, (1793-1861), Online publication date: 1-Jan-2015.
- Berend D and Kontorovich A (2015). A finite sample analysis of the Naive Bayes classifier, The Journal of Machine Learning Research, 16:1, (1519-1545), Online publication date: 1-Jan-2015.
- Moroshko E, Vaits N and Crammer K (2015). Second-order non-stationary online learning for regression, The Journal of Machine Learning Research, 16:1, (1481-1517), Online publication date: 1-Jan-2015.
- Krueger T, Panknin D and Braun M (2015). Fast cross-validation via sequential testing, The Journal of Machine Learning Research, 16:1, (1103-1155), Online publication date: 1-Jan-2015.
- Bernstein A and Shimkin N (2015). Response-based approachability with applications to generalized no-regret problems, The Journal of Machine Learning Research, 16:1, (747-773), Online publication date: 1-Jan-2015.
- Rakhlin A, Sridharan K and Tewari A (2015). Online learning via sequential complexities, The Journal of Machine Learning Research, 16:1, (155-186), Online publication date: 1-Jan-2015.
- Chang H and Choe S (2015). Combining multiple strategies for multiarmed bandit problems and asymptotic optimality, Journal of Control Science and Engineering, 2015, (13-13), Online publication date: 1-Jan-2015.
- Slivkins A and Vaughan J (2014). Online decision making in crowdsourcing markets, ACM SIGecom Exchanges, 12:2, (4-23), Online publication date: 25-Nov-2014.
- Ngo H, Luciw M, Nagi J, Forster A, Schmidhuber J and Vien N (2014). Efficient Interactive Multiclass Learning from Binary Feedback, ACM Transactions on Interactive Intelligent Systems, 4:3, (1-25), Online publication date: 21-Nov-2014.
- Lefortier D, Serdyukov P and de Rijke M Online Exploration for Detecting Shifts in Fresh Intent Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management, (589-598)
- Sahoo D, Hoi S and Li B Online multiple kernel regression Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data mining, (293-302)
- Panigrahy R and Popat P Optimal amortized regret in every interval Proceedings of the Thirtieth Conference on Uncertainty in Artificial Intelligence, (663-671)
- Kanade V and Steinke T (2014). Learning Hurdles for Sleeping Experts, ACM Transactions on Computation Theory, 6:3, (1-16), Online publication date: 1-Jul-2014.
- Dekel O, Ding J, Koren T and Peres Y Bandits with switching costs Proceedings of the forty-sixth annual ACM symposium on Theory of computing, (459-467)
- Chen P and Lu C Generalized mirror descents in congestion games with splittable flows Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (1233-1240)
- Elidrisi M, Johnson N, Gini M and Crandall J Fast adaptive learning in repeated stochastic games by game abstraction Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems, (1141-1148)
- Waterland A, Angelino E, Adams R, Appavoo J and Seltzer M (2014). ASC, ACM SIGARCH Computer Architecture News, 42:1, (575-590), Online publication date: 5-Apr-2014.
- Waterland A, Angelino E, Adams R, Appavoo J and Seltzer M (2014). ASC, ACM SIGPLAN Notices, 49:4, (575-590), Online publication date: 5-Apr-2014.
- Gama J, Žliobaitė I, Bifet A, Pechenizkiy M and Bouchachia A (2014). A survey on concept drift adaptation, ACM Computing Surveys, 46:4, (1-37), Online publication date: 1-Apr-2014.
- Waterland A, Angelino E, Adams R, Appavoo J and Seltzer M ASC Proceedings of the 19th international conference on Architectural support for programming languages and operating systems, (575-590)
- Buchbinder N, Chen S and Naor J Competitive analysis via regularization Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete algorithms, (436-444)
- Li B and Hoi S (2014). Online portfolio selection, ACM Computing Surveys, 46:3, (1-36), Online publication date: 1-Jan-2014.
- Mertikopoulos P and Belmega E Adaptive spectrum management in MIMO-OFDM cognitive radio Proceedings of the 7th International Conference on Performance Evaluation Methodologies and Tools, (243-252)
- Arias M, Arratia A and Xuriguera R (2014). Forecasting with twitter data, ACM Transactions on Intelligent Systems and Technology, 5:1, (1-24), Online publication date: 1-Dec-2013.
- Wu P, Hoi S, Xia H, Zhao P, Wang D and Miao C Online multimodal deep similarity learning with application to image retrieval Proceedings of the 21st ACM international conference on Multimedia, (153-162)
- Boley M, Mampaey M, Kang B, Tokmakov P and Wrobel S One click mining Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics, (27-35)
- Jie L, Lamkhede S, Sapra R, Hsu E, Song H and Chang Y A unified search federation system based on online user feedback Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, (1195-1203)
- Gu Q, Aggarwal C, Liu J and Han J Selective sampling on graphs for classification Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining, (131-139)
- Benaïm M and Faure M (2013). Consistency of Vanishingly Smooth Fictitious Play, Mathematics of Operations Research, 38:3, (437-450), Online publication date: 1-Aug-2013.
- Lepping J, Mertikopoulos P and Trystram D Accelerating population-based search heuristics by adaptive resource allocation Proceedings of the 15th annual conference on Genetic and evolutionary computation, (1165-1172)
- Abernethy J, Chen Y and Vaughan J (2013). Efficient Market Making via Convex Optimization, and a Connection to Online Learning, ACM Transactions on Economics and Computation, 1:2, (1-39), Online publication date: 1-May-2013.
- Gijsberts A and Metta G (2013). 2013 Special Issue, Neural Networks, 41, (59-69), Online publication date: 1-May-2013.
- Shahaf D, Guestrin C and Horvitz E (2013). "Metro maps of information" by Dafna Shahaf, Carlos Guestrin and Eric Horvitz, with Ching-man Au Yeung as coordinator, ACM SIGWEB Newsletter, 2013:Spring, (1-9), Online publication date: 1-Apr-2013.
- Li B, Hoi S, Zhao P and Gopalkrishnan V (2013). Confidence Weighted Mean Reversion Strategy for Online Portfolio Selection, ACM Transactions on Knowledge Discovery from Data, 7:1, (1-38), Online publication date: 1-Mar-2013.
- Buhmann J, Mihalak M, Sramek R and Widmayer P Robust optimization in the presence of uncertainty Proceedings of the 4th conference on Innovations in Theoretical Computer Science, (505-514)
- Cesa-Bianchi N, Gentile C and Mansour Y Regret minimization for reserve prices in second-price auctions Proceedings of the twenty-fourth annual ACM-SIAM symposium on Discrete algorithms, (1190-1204)
- Nazerzadeh H, Saberi A and Vohra R (2013). Dynamic Pay-Per-Action Mechanisms and Applications to Online Advertising, Operations Research, 61:1, (98-111), Online publication date: 1-Jan-2013.
- Gordon G, Varakantham P, Yeoh W, Lau H, Aravamudhan A and Cheng S Lagrangian Relaxation for Large-Scale Multi-agent Planning Proceedings of the The 2012 IEEE/WIC/ACM International Joint Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02, (494-501)
- Besbes O and Zeevi A (2012). Blind Network Revenue Management, Operations Research, 60:6, (1537-1550), Online publication date: 1-Nov-2012.
- Raman K, Svore K, Gilad-Bachrach R and Burges C Learning from mistakes Proceedings of the 21st ACM international conference on Information and knowledge management, (1930-1934)
- Ghosh M and Nandakumar S Predictive complexity and generalized entropy rate of stationary ergodic processes Proceedings of the 23rd international conference on Algorithmic Learning Theory, (365-379)
- Adamskiy D, Koolen W, Chernov A and Vovk V A closer look at adaptive regret Proceedings of the 23rd international conference on Algorithmic Learning Theory, (290-304)
- Gofer E and Mansour Y Lower bounds on individual sequence regret Proceedings of the 23rd international conference on Algorithmic Learning Theory, (275-289)
- Moroshko E and Crammer K Weighted last-step min-max algorithm with improved sub-logarithmic regret Proceedings of the 23rd international conference on Algorithmic Learning Theory, (245-259)
- Mohri M and Muñoz Medina A New analysis and algorithm for learning with drifting distributions Proceedings of the 23rd international conference on Algorithmic Learning Theory, (124-138)
- Lim A, Shanthikumar J and Vahn G (2012). Robust Portfolio Choice with Learning in the Framework of Regret, Management Science, 58:9, (1732-1746), Online publication date: 1-Sep-2012.
- Hoi S, Wang J, Zhao P and Jin R Online feature selection for mining big data Proceedings of the 1st International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, (93-100)
- Seshia S and Rakhlin A (2012). Quantitative Analysis of Systems Using Game-Theoretic Learning, ACM Transactions on Embedded Computing Systems, 11:S2, (1-27), Online publication date: 1-Aug-2012.
- Doerr B, Hota A and Kötzing T Ants easily solve stochastic shortest path problems Proceedings of the 14th annual conference on Genetic and evolutionary computation, (17-24)
- Beygelzimer A, Langford J and Pennock D Learning performance of prediction markets with Kelly bettors Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 3, (1317-1318)
- Azar Y, Feige U, Tennenholtz M and Feldman M Mastering multi-player games Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (897-904)
- Babaioff M, Dughmi S, Kleinberg R and Slivkins A Dynamic pricing with limited supply Proceedings of the 13th ACM Conference on Electronic Commerce, (74-91)
- Mejer A and Crammer K Training dependency parser using light feedback Proceedings of the 2012 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, (488-497)
- Abernethy J, Frongillo R and Wibisono A Minimax option pricing meets black-scholes in the limit Proceedings of the forty-fourth annual ACM symposium on Theory of computing, (1029-1040)
- Narayanaswamy B, Garg V and Jayram T Online optimization for the smart (micro) grid Proceedings of the 3rd International Conference on Future Energy Systems: Where Energy, Computing and Communication Meet, (1-10)
- Larroca F and Rougier J (2012). Minimum delay load-balancing via nonparametric regression and no-regret algorithms, Computer Networks: The International Journal of Computer and Telecommunications Networking, 56:4, (1152-1166), Online publication date: 1-Mar-2012.
- Shalev-Shwartz S (2012). Online Learning and Online Convex Optimization, Foundations and Trends® in Machine Learning, 4:2, (107-194), Online publication date: 1-Feb-2012.
- Kanade V and Steinke T Learning hurdles for sleeping experts Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, (11-18)
- Radunovic B, Proutiere A, Gunawardena D and Key P Dynamic channel, rate selection and scheduling for white spaces Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies, (1-12)
- Nelson B, Biggio B and Laskov P Understanding the risk factors of learning in adversarial environments Proceedings of the 4th ACM workshop on Security and artificial intelligence, (87-92)
- Huang L, Joseph A, Nelson B, Rubinstein B and Tygar J Adversarial machine learning Proceedings of the 4th ACM workshop on Security and artificial intelligence, (43-58)
- Gofer E and Mansour Y Pricing exotic derivatives using regret minimization Proceedings of the 4th international conference on Algorithmic game theory, (266-277)
- Lu C and Lu W Making online decisions with bounded memory Proceedings of the 22nd international conference on Algorithmic learning theory, (249-261)
- Gofer E and Mansour Y Regret minimization algorithms for pricing lookback options Proceedings of the 22nd international conference on Algorithmic learning theory, (234-248)
- Garivier A and Moulines E On upper-confidence bound policies for switching bandit problems Proceedings of the 22nd international conference on Algorithmic learning theory, (174-188)
- Dalalyan A and Salmon J Competing against the best nearest neighbor filter in regression Proceedings of the 22nd international conference on Algorithmic learning theory, (129-143)
- Vaits N and Crammer K Re-adapting the regularization of weights for non-stationary regression Proceedings of the 22nd international conference on Algorithmic learning theory, (114-128)
- Gerchinovitz S and Yu J Adaptive and optimal online linear regression on l1-balls Proceedings of the 22nd international conference on Algorithmic learning theory, (99-113)
- Peng J, Barbu C, Seetharaman G, Fan W, Wu X and Palaniappan K ShareBoost Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part II, (597-612)
- Busa-Fekete R, Kégl B, Éltetö T and Szarvas G A robust ranking methodology based on diverse calibration of AdaBoost Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part I, (263-279)
- Peng J, Barbu C, Seetharaman G, Fan W, Wu X and Palaniappan K ShareBoost Proceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II, (597-612)
- Busa-Fekete R, Kégl B, Éltető T and Szarvas G A Robust ranking methodology based on diverse calibration of AdaBoost Proceedings of the 2011th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part I, (263-279)
- Kleinberg R, Piliouras G and Tardos É (2011). Load balancing without regret in the bulletin board model, Distributed Computing, 24:1, (21-29), Online publication date: 1-Sep-2011.
- Das P and Banerjee A Meta optimization and its application to portfolio selection Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, (1163-1171)
- Valizadegan H, Jin R and Wang S Learning to trade off between exploration and exploitation in multiclass bandit prediction Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining, (204-212)
- Koriche F Relational networks of conditional preferences Proceedings of the 21st international conference on Inductive Logic Programming, (26-32)
- Rostamizadeh A, Agarwal A and Bartlett P Learning with missing features Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, (635-642)
- Hoffman M, Brochu E and de Freitas N Portfolio allocation for Bayesian optimization Proceedings of the Twenty-Seventh Conference on Uncertainty in Artificial Intelligence, (327-336)
- Salperwyck C and Urvoy T Stumping along a summary for exploration & exploitation challenge 2011 Proceedings of the 2011 International Conference on On-line Trading of Exploration and Exploitation 2 - Volume 26, (86-97)
- Abernethy J, Chen Y and Wortman Vaughan J An optimization-based framework for automated market-making Proceedings of the 12th ACM conference on Electronic commerce, (297-306)
- Auger D Multiple tree for partially observable Monte-Carlo tree search Proceedings of the 2011 international conference on Applications of evolutionary computation - Volume Part I, (53-62)
- Vallam R, Kanagasabapathy A and Murthy C (2011). A non-cooperative game-theoretic approach to channel assignment in multi-channel multi-radio wireless networks, Wireless Networks, 17:2, (411-435), Online publication date: 1-Feb-2011.
- Daskalakis C, Deckelbaum A and Kim A Near-optimal no-regret algorithms for zero-sum games Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (235-254)
- Cai Y and Daskalakis C On minmax theorems for multiplayer games Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithms, (217-234)
- Besbes O and Zeevi A (2011). On the Minimax Complexity of Pricing in a Changing Environment, Operations Research, 59:1, (66-79), Online publication date: 1-Jan-2011.
- Immorlica N, Markakis E and Piliouras G Coalition formation and price of anarchy in cournot oligopolies Proceedings of the 6th international conference on Internet and network economics, (270-281)
- Filippi S, Cappé O, Garivier A and Szepesvári C Parametric bandits Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 1, (586-594)
- Crammer K and Lee D Learning via Gaussian Herding Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 1, (451-459)
- Bernstein A, Mannor S and Shimkin N Online classification with specificity constraints Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 1, (190-198)
- Srebro N, Sridharan K and Tewari A Smoothness, low-noise and fast rates Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 2, (2199-2207)
- Rakhlin A, Sridharan K and Tewari A Online learning Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 2, (1984-1992)
- Orabona F and Crammer K New adaptive algorithms for online classification Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 2, (1840-1848)
- Narayanan H and Rakhlin A Random walk approach to regret minimization Proceedings of the 23rd International Conference on Neural Information Processing Systems - Volume 2, (1777-1785)
- Mannor S and Stoltz G (2010). A Geometric Proof of Calibration, Mathematics of Operations Research, 35:4, (721-727), Online publication date: 1-Nov-2010.
- Nadav U and Piliouras G No regret learning in oligopolies Proceedings of the Third international conference on Algorithmic game theory, (300-311)
- Mejer A and Crammer K Confidence in structured-prediction using confidence-weighted models Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing, (971-981)
- Zhdanov F and Kalnishkan Y An identity for kernel ridge regression Proceedings of the 21st international conference on Algorithmic learning theory, (405-419)
- Jin R, Hoi S and Yang T Online multiple kernel learning Proceedings of the 21st international conference on Algorithmic learning theory, (390-404)
- Abernethy J, Bartlett P, Buchbinder N and Stanton I A regularization approach to metrical task systems Proceedings of the 21st international conference on Algorithmic learning theory, (270-284)
- Chernov A and Zhdanov F Prediction with expert advice under discounted loss Proceedings of the 21st international conference on Algorithmic learning theory, (255-269)
- Bartók G, Pál D and Szepesvári C Toward a classification of finite partial-monitoring games Proceedings of the 21st international conference on Algorithmic learning theory, (224-238)
- Balle B, Castro J and Gavaldà R A lower bound for learning distributions generated by probabilistic automata Proceedings of the 21st international conference on Algorithmic learning theory, (179-193)
- Nelson B, Rubinstein B, Huang L, Joseph A and Tygar J Classifier evasion Proceedings of the international ECML/PKDD conference on Privacy and security issues in data mining and machine learning, (92-98)
- Maillard O and Munos R Online learning in adversarial Lipschitz environments Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part II, (305-320)
- Maillard O and Munos R Online learning in adversarial Lipschitz environments Proceedings of the 2010th European Conference on Machine Learning and Knowledge Discovery in Databases - Volume Part II, (305-320)
- Sempolinski P and Chaudhary A Online algorithms for the newsvendor problem with and without censored demands Proceedings of the 4th international conference on Frontiers in algorithmics, (234-249)
- Bifet A Adaptive Stream Mining Proceedings of the 2010 conference on Adaptive Stream Mining: Pattern Learning and Mining from Evolving Data Streams, (1-212)
- Li W, Wang X, Zhang R, Cui Y, Mao J and Jin R Exploitation and exploration in a performance based contextual advertising system Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, (27-36)
- Zhao P and Hoi S OTL Proceedings of the 27th International Conference on International Conference on Machine Learning, (1231-1238)
- Slivkins A, Radlinski F and Gollapudi S Learning optimally diverse rankings over large document collections Proceedings of the 27th International Conference on International Conference on Machine Learning, (983-990)
- Sakuma J and Arai H Online prediction with privacy Proceedings of the 27th International Conference on International Conference on Machine Learning, (935-942)
- Liang P and Srebro N On the interaction between norm and dimensionality Proceedings of the 27th International Conference on International Conference on Machine Learning, (647-654)
- Kulis B and Bartlett P Implicit online learning Proceedings of the 27th International Conference on International Conference on Machine Learning, (575-582)
- Cesa-Bianchi N, Shalev-Shwartz S and Shamir O Efficient learning with partially observed attributes Proceedings of the 27th International Conference on International Conference on Machine Learning, (183-190)
- Busa-Fekete R and Kégl B Fast boosting using adversarial bandits Proceedings of the 27th International Conference on International Conference on Machine Learning, (143-150)
- De Oliveira E and Caticha N (2010). Inference from aging information, IEEE Transactions on Neural Networks, 21:6, (1015-1020), Online publication date: 1-Jun-2010.
- Efraimidis P, Tsavlidis L and Mertzios G (2010). Window-games between TCP flows, Theoretical Computer Science, 411:31-33, (2798-2817), Online publication date: 1-Jun-2010.
- Ganchev K, Nevmyvaka Y, Kearns M and Vaughan J (2010). Censored exploration and the dark pool problem, Communications of the ACM, 53:5, (99-107), Online publication date: 1-May-2010.
- Sandler M and Muthukrishnan S Monitoring algorithms for negative feedback systems Proceedings of the 19th international conference on World wide web, (871-880)
- Hussain Z, Pasupa K and Shawe-Taylor J Learning relevant eye movement feature spaces across users Proceedings of the 2010 Symposium on Eye-Tracking Research & Applications, (181-185)
- Cavallanti G, Cesa-Bianchi N and Gentile C (2010). Linear Algorithms for Online Multitask Classification, The Journal of Machine Learning Research, 11, (2901-2934), Online publication date: 1-Mar-2010.
- Audibert J and Bubeck S (2010). Regret Bounds and Minimax Policies under Partial Monitoring, The Journal of Machine Learning Research, 11, (2785-2836), Online publication date: 1-Mar-2010.
- Xiao L (2010). Dual Averaging Methods for Regularized Stochastic Learning and Online Optimization, The Journal of Machine Learning Research, 11, (2543-2596), Online publication date: 1-Mar-2010.
- Ryabko D (2010). On Finding Predictors for Arbitrary Families of Processes, The Journal of Machine Learning Research, 11, (581-602), Online publication date: 1-Mar-2010.
- György A, Lugosi G and Ottucsàk G (2010). On-Line Sequential Bin Packing, The Journal of Machine Learning Research, 11, (89-109), Online publication date: 1-Mar-2010.
- Anthony B, Goyal V, Gupta A and Nagarajan V (2010). A Plant Location Guide for the Unsure, Mathematics of Operations Research, 35:1, (79-101), Online publication date: 1-Feb-2010.
- Kleinberg R and Slivkins A Sharp dichotomies for regret minimization in metric spaces Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (827-846)
- Chiang C and Lu C Online learning with queries Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (616-629)
- Bansal N, Buchbinder N and Naor J Towards the randomized k-server conjecture Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms, (40-55)
- Cornuéjols A On-line learning Ubiquitous knowledge discovery, (129-147)
- Cornuéjols A On-line learning Ubiquitous knowledge discovery, (129-147)
- Syed Z, Stultz C, Kellis M, Indyk P and Guttag J (2010). Motif discovery in physiological datasets, ACM Transactions on Knowledge Discovery from Data, 4:1, (1-23), Online publication date: 1-Jan-2010.
- Vovk V and Zhdanov F (2009). Prediction With Expert Advice For The Brier Game, The Journal of Machine Learning Research, 10, (2445-2471), Online publication date: 1-Dec-2009.
- Helmbold D and Warmuth M (2009). Learning Permutations with Exponential Weights, The Journal of Machine Learning Research, 10, (1705-1736), Online publication date: 1-Dec-2009.
- Feldman M (2009). A prescriptive approach for playing games, ACM SIGecom Exchanges, 8:2, (1-4), Online publication date: 1-Dec-2009.
- Rubinstein B, Nelson B, Huang L, Joseph A, Lau S, Rao S, Taft N and Tygar J ANTIDOTE Proceedings of the 9th ACM SIGCOMM conference on Internet measurement, (1-14)
- Besbes O and Zeevi A (2009). Dynamic Pricing Without Knowing the Demand Function, Operations Research, 57:6, (1407-1420), Online publication date: 1-Nov-2009.
- Moon T and Weissman T (2009). Discrete denoising with shifts, IEEE Transactions on Information Theory, 55:11, (5284-5301), Online publication date: 1-Nov-2009.
- Dekel O, Shalev-Shwartz S and Singer Y (2009). Individual sequence prediction using memory-efficient context trees, IEEE Transactions on Information Theory, 55:11, (5251-5262), Online publication date: 1-Nov-2009.
- V'yugin V Learning volatility of discrete time series using prediction with expert advice Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications, (16-30)
- Perchet V Calibration and internal no-regret with random signals Proceedings of the 20th international conference on Algorithmic learning theory, (68-82)
- V'yugin V The follow perturbed leader algorithm protected from unbounded one-step losses Proceedings of the 20th international conference on Algorithmic learning theory, (38-52)
- Chernov A and Vovk V Prediction with expert evaluators' advice Proceedings of the 20th international conference on Algorithmic learning theory, (8-22)
- Le Cadre H, Bouhtou M and Tuffin B (2009). Consumers' preference modeling to price bundle offers in the telecommunications industry, Netnomics, 10:2, (171-208), Online publication date: 1-Oct-2009.
- Kozat S and Singer A (2009). Competitive prediction under additive noise, IEEE Transactions on Signal Processing, 57:9, (3698-3703), Online publication date: 1-Sep-2009.
- Kleinberg R, Piliouras G and Tardos É Load balancing without regret in the bulletin board model Proceedings of the 28th ACM symposium on Principles of distributed computing, (56-62)
- Yu J, Mannor S and Shimkin N (2009). Markov Decision Processes with Arbitrary Reward Processes, Mathematics of Operations Research, 34:3, (737-757), Online publication date: 1-Aug-2009.
- Babaioff M, Sharma Y and Slivkins A Characterizing truthful multi-armed bandit mechanisms Proceedings of the 10th ACM conference on Electronic commerce, (79-88)
- Ratliff N, Silver D and Bagnell J (2009). Learning to search, Autonomous Robots, 27:1, (25-53), Online publication date: 1-Jul-2009.
- El-Arini K, Veda G, Shahaf D and Guestrin C Turning down the noise in the blogosphere Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (289-298)
- Delage E Regret-based online ranking for a growing digital library Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining, (229-238)
- Ryabko D Characterizing predictable classes of processes Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, (471-478)
- Ganchev K, Kearns M, Nevmyvaka Y and Vaughan J Censored exploration and the Dark Pool Problem Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, (185-194)
- Bradley D and Bagnell J Convex coding Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, (83-90)
- Bartlett P and Tewari A REGAL Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, (35-42)
- Yu J and Mannor S Piecewise-stationary bandit problems with side observations Proceedings of the 26th Annual International Conference on Machine Learning, (1177-1184)
- Sutskever I A simpler unified analysis of budget perceptrons Proceedings of the 26th Annual International Conference on Machine Learning, (985-992)
- Hazan E and Seshadhri C Efficient learning algorithms for changing environments Proceedings of the 26th Annual International Conference on Machine Learning, (393-400)
- Kozat S and Singer A (2009). Switching strategies for sequential decision problems with multiplicative loss with application to portfolios, IEEE Transactions on Signal Processing, 57:6, (2192-2208), Online publication date: 1-Jun-2009.
- Roughgarden T Intrinsic robustness of the price of anarchy Proceedings of the forty-first annual ACM symposium on Theory of computing, (513-522)
- Kash I, Friedman E and Halpern J Multiagent learning in large anonymous games Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2, (765-772)
- Ghosh A, Rubinstein B, Vassilvitskii S and Zinkevich M Adaptive bidding for display advertising Proceedings of the 18th international conference on World wide web, (251-260)
- Moon T and Weissman T (2009). Universal FIR MMSE filtering, IEEE Transactions on Signal Processing, 57:3, (1068-1083), Online publication date: 1-Mar-2009.
- Olszewski W and Sandroni A (2009). Strategic Manipulation of Empirical Tests, Mathematics of Operations Research, 34:1, (57-70), Online publication date: 1-Feb-2009.
- Hazan E and Kale S Better algorithms for benign bandits Proceedings of the twentieth annual ACM-SIAM symposium on Discrete algorithms, (38-47)
- Boucheron S, Garivier A and Gassiat E (2009). Coding on countably infinite alphabets, IEEE Transactions on Information Theory, 55:1, (358-373), Online publication date: 1-Jan-2009.
- Seshia S and Rakhlin A Game-theoretic timing analysis Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design, (575-582)
- Resnick P and Sami R (2008). Manipulation-resistant recommender systems through influence limits, ACM SIGecom Exchanges, 7:3, (1-4), Online publication date: 1-Nov-2008.
- Barreno M, Bartlett P, Chi F, Joseph A, Nelson B, Rubinstein B, Saini U and Tygar J Open problems in the security of learning Proceedings of the 1st ACM workshop on Workshop on AISec, (19-26)
- Resnick P and Sami R The information cost of manipulation-resistance in recommender systems Proceedings of the 2008 ACM conference on Recommender systems, (147-154)
- Kveton B, Yu J, Theocharous G and Mannor S Online learning with expert advice and finite-horizon constraints Proceedings of the 23rd national conference on Artificial intelligence - Volume 1, (331-336)
- Chen Y, Fortnow L, Lambert N, Pennock D and Wortman J Complexity of combinatorial market makers Proceedings of the 9th ACM conference on Electronic commerce, (190-199)
- Vovk V and Zhdanov F Prediction with expert advice for the Brier game Proceedings of the 25th international conference on Machine learning, (1104-1111)
- Papadimitriou C and Roughgarden T (2008). Computing correlated equilibria in multi-player games, Journal of the ACM, 55:3, (1-29), Online publication date: 1-Jul-2008.
- Koriche F Online Rule Learning via Weighted Model Counting Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence, (112-116)
- Kleinberg R, Slivkins A and Upfal E Multi-armed bandits in metric spaces Proceedings of the fortieth annual ACM symposium on Theory of computing, (681-690)
- Anthony B, Goyal V, Gupta A and Nagarajan V A plant location guide for the unsure Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms, (1164-1173)
- Hazan E, Agarwal A and Kale S (2007). Logarithmic regret algorithms for online convex optimization, Machine Language, 69:2-3, (169-192), Online publication date: 1-Dec-2007.
- Resnick P and Sami R The influence limiter Proceedings of the 2007 ACM conference on Recommender systems, (25-32)
- Busuttil S and Kalnishkan Y Weighted Kernel Regression for Predicting Changing Dependencies Proceedings of the 18th European conference on Machine Learning, (535-542)
- Mansour Y Learning, regret minimization and option pricing Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge, (2-3)
- Rakhlin A, Abernethy J and Bartlett P Online discovery of similarity mappings Proceedings of the 24th international conference on Machine learning, (767-774)
- Lugosi G Sequential prediction under incomplete feedback Proceedings of the 2007 conference on Artificial Intelligence Research and Development, (3-5)
- Hart S and Mansour Y The communication complexity of uncoupled nash equilibrium procedures Proceedings of the thirty-ninth annual ACM symposium on Theory of computing, (345-353)
- Heidari F, Mannor S and Mason L Reinforcement learning-based load shared sequential routing Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet, (832-843)
- Baskiotis N, Sebag M, Gaudel M and Gouraud S A machine learning approach for statistical software testing Proceedings of the 20th international joint conference on Artifical intelligence, (2274-2279)
- Cesa-Bianchi N, Gentile C and Zaniboni L (2006). Worst-Case Analysis of Selective Sampling for Linear Classification, The Journal of Machine Learning Research, 7, (1205-1230), Online publication date: 1-Dec-2006.
- Ryabko D and Hutter M Asymptotic learnability of reinforcement problems with arbitrary dependence Proceedings of the 17th international conference on Algorithmic Learning Theory, (334-347)
- Allenberg C, Auer P, Györfi L and Ottucsák G Hannan consistency in on-line learning in case of unbounded losses under partial monitoring Proceedings of the 17th international conference on Algorithmic Learning Theory, (229-243)
- Vovk V Leading strategies in competitive on-line prediction Proceedings of the 17th international conference on Algorithmic Learning Theory, (214-228)
- Cesa-Bianchi N, Lugosi G and Stoltz G (2006). Regret Minimization Under Partial Monitoring, Mathematics of Operations Research, 31:3, (562-580), Online publication date: 1-Aug-2006.
- Cesa-Bianchi N, Mansour Y and Stoltz G Improved second-order bounds for prediction with expert advice Proceedings of the 18th annual conference on Learning Theory, (217-232)
- Shui C, Wang W, Hedhli I, Wong C, Wan F, Wang B and Gagné C Lifelong Online Learning from Accumulated Knowledge, ACM Transactions on Knowledge Discovery from Data, 0:0
- Farina G, Celli A, Marchesi A and Gatti N Simple Uncoupled No-Regret Learning Dynamics for Extensive-Form Correlated Equilibrium, Journal of the ACM, 0:0
- Immorlica N, Sankararaman K, Schapire R and Slivkins A Adversarial Bandits with Knapsacks, Journal of the ACM, 0:0
- Yang T and Ying Y AUC Maximization in the Era of Big Data and AI: A Survey, ACM Computing Surveys, 0:0
- Choi J Multichannel ALOHA with Exploration Phase 2020 IEEE Wireless Communications and Networking Conference (WCNC), (1-6)
- Leguay J, Maggi L, Draief M, Paris S and Chouvardas S Admission control with online algorithms in SDN NOMS 2016 - 2016 IEEE/IFIP Network Operations and Management Symposium, (718-721)
- Deng H and Hou I Online job allocation with hard allocation ratio requirement IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications, (1-9)
- Wilson C and Veeravalli V Adaptive sequential optimization with applications to machine learning 2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), (2642-2646)
- Krichene S, Krichene W, Dong R and Bayen A Convergence of heterogeneous distributed learning in stochastic routing games 2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton), (480-487)
Index Terms
- Prediction, Learning, and Games
Recommendations
Digital educational games in science learning: a review of empirical research
Edutainment'11: Proceedings of the 6th international conference on E-learning and games, edutainment technologiesThis study is an initial attempt to review digital educational games in science learning. A total of 8 studies were selected from ISI database for review. A series of content analyses demonstrated that role-playing games are relatively more popular in ...
Data-driven Prediction Games
CHI EA '16: Proceedings of the 2016 CHI Conference Extended Abstracts on Human Factors in Computing SystemsMore datasets are becoming available on the web. This provides new opportunities for data-driven systems that can entertain and inform. We introduce prediction games, data-driven games modeled after fantasy sports. We hypothesize that prediction games ...
Blending Video Games Into Language Learning
Around 2 billion people worldwide engage in video games and a similar number of English language learners are anticipated by the year 2020. It can be assumed that many language learners are also 'gamers', and that a language learner may play a video ...