Stop the war!Остановите войну!
for scientists:
Google
Google Scholar
Semantic Scholar
IA Scholar
CiteSeerX
ORCIDBranislav Kveton
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j5]Branislav Kveton, Muhammad Jehangir Amjad, Christophe Diot, Dimitris Konomis, Augustin Soule, Xiaolong Yang:
Optimal probing with statistical guarantees for network monitoring at scale. Comput. Commun. 192: 119-131 (2022)- [c88]Ruihao Zhu, Branislav Kveton:
Safe Optimal Design with Applications in Off-Policy Learning. AISTATS 2022: 2436-2447 - [c87]Rong Zhu, Branislav Kveton:
Random Effect Bandits. AISTATS 2022: 3091-3107 - [c86]Branislav Kveton, Ofer Meshi, Masrour Zoghi, Zhen Qin:
On the Value of Prior in Online Learning to Rank. AISTATS 2022: 6880-6892 - [c85]Joey Hong, Branislav Kveton, Manzil Zaheer, Mohammad Ghavamzadeh, Craig Boutilier:
Thompson Sampling with a Mixture Prior. AISTATS 2022: 7565-7586 - [c84]Joey Hong, Branislav Kveton, Manzil Zaheer, Mohammad Ghavamzadeh:
Hierarchical Bayesian Bandits. AISTATS 2022: 7724-7741 - [c83]Behnam Rahdari, Peter Brusilovsky, Branislav Kveton:
Towards Increasing the Coverage of Interactive Recommendations. FLAIRS Conference 2022 - [c82]Behnam Rahdari, Branislav Kveton, Peter Brusilovsky:
The Magic of Carousels: Single vs. Multi-List Recommender Systems. HT 2022: 166-174 - [c81]Joey Hong, Branislav Kveton, Sumeet Katariya, Manzil Zaheer, Mohammad Ghavamzadeh:
Deep Hierarchy in Bandits. ICML 2022: 8833-8851 - [c80]Runzhe Wan, Branislav Kveton, Rui Song:
Safe Exploration for Efficient Policy Evaluation and Comparison. ICML 2022: 22491-22511 - [c79]Mohammad Javad Azizi, Branislav Kveton, Mohammad Ghavamzadeh:
Fixed-Budget Best-Arm Identification in Structured Bandits. IJCAI 2022: 2798-2804 - [c78]Nan Wang, Hongning Wang, Maryam Karimzadehgan, Branislav Kveton, Craig Boutilier:
IMO^3: Interactive Multi-Objective Off-Policy Optimization. IJCAI 2022: 3523-3529 - [i63]Nan Wang, Hongning Wang, Maryam Karimzadehgan, Branislav Kveton, Craig Boutilier:
IMO3: Interactive Multi-Objective Off-Policy Optimization. CoRR abs/2201.09798 (2022) - [i62]Joey Hong, Branislav Kveton, Sumeet Katariya, Manzil Zaheer, Mohammad Ghavamzadeh:
Deep Hierarchy in Bandits. CoRR abs/2202.01454 (2022) - [i61]Mohammad Javad Azizi, Branislav Kveton, Mohammad Ghavamzadeh, Sumeet Katariya:
Meta-Learning for Simple Regret Minimization. CoRR abs/2202.12888 (2022) - [i60]Runzhe Wan, Branislav Kveton, Rui Song:
Safe Exploration for Efficient Policy Evaluation and Comparison. CoRR abs/2202.13234 (2022) - [i59]Imad Aouali, Branislav Kveton, Sumeet Katariya:
Generalizing Hierarchical Bayesian Bandits. CoRR abs/2205.15124 (2022) - [i58]Matej Cief, Branislav Kveton, Michal Kompan:
Pessimistic Off-Policy Optimization for Learning to Rank. CoRR abs/2206.02593 (2022) - [i57]Yu-Guan Hsieh, Shiva Prasad Kasiviswanathan, Branislav Kveton:
Uplifting Bandits. CoRR abs/2206.04091 (2022) - 2021
- [c77]Joey Hong, Branislav Kveton, Manzil Zaheer, Yinlam Chow, Amr Ahmed:
Non-Stationary Off-Policy Optimization. AISTATS 2021: 2494-2502 - [c76]Branislav Kveton, Mikhail Konobeev, Manzil Zaheer, Chih-Wei Hsu, Martin Mladenov, Craig Boutilier, Csaba Szepesvári:
Meta-Thompson Sampling. ICML 2021: 5884-5893 - [c75]Soumya Basu, Branislav Kveton, Manzil Zaheer, Csaba Szepesvári:
No Regrets for Learning the Prior in Bandits. NeurIPS 2021: 28029-28041 - [c74]Nan Wang, Branislav Kveton, Maryam Karimzadehgan:
CORe: Capitalizing On Rewards in Bandit Exploration. UAI 2021: 1968-1978 - [i56]Branislav Kveton, Mikhail Konobeev, Manzil Zaheer, Chih-Wei Hsu, Martin Mladenov, Craig Boutilier, Csaba Szepesvári:
Meta-Thompson Sampling. CoRR abs/2102.06129 (2021) - [i55]Nan Wang, Branislav Kveton, Maryam Karimzadehgan:
CORe: Capitalizing On Rewards in Bandit Exploration. CoRR abs/2103.04387 (2021) - [i54]Mohammad Javad Azizi, Branislav Kveton, Mohammad Ghavamzadeh:
Fixed-Budget Best-Arm Identification in Contextual Bandits: A Static-Adaptive Algorithm. CoRR abs/2106.04763 (2021) - [i53]Joey Hong, Branislav Kveton, Manzil Zaheer, Mohammad Ghavamzadeh, Craig Boutilier:
Thompson Sampling with a Mixture Prior. CoRR abs/2106.05608 (2021) - [i52]Rong Zhu, Branislav Kveton:
Random Effect Bandits. CoRR abs/2106.12200 (2021) - [i51]Soumya Basu, Branislav Kveton, Manzil Zaheer, Csaba Szepesvári:
No Regrets for Learning the Prior in Bandits. CoRR abs/2107.06196 (2021) - [i50]Muhammad Jehangir Amjad, Christophe Diot, Dimitris Konomis, Branislav Kveton, Augustin Soule, Xiaolong Yang:
Optimal Probing with Statistical Guarantees for Network Monitoring at Scale. CoRR abs/2109.07743 (2021) - [i49]Ruihao Zhu, Branislav Kveton:
Safe Optimal Design with Applications in Policy Learning. CoRR abs/2111.04835 (2021) - [i48]Joey Hong, Branislav Kveton, Manzil Zaheer, Mohammad Ghavamzadeh:
Hierarchical Bayesian Bandits. CoRR abs/2111.06929 (2021) - 2020
- [c73]Sharan Vaswani, Abbas Mehrabian, Audrey Durand, Branislav Kveton:
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. AISTATS 2020: 1988-1998 - [c72]Branislav Kveton, Manzil Zaheer, Csaba Szepesvári, Lihong Li, Mohammad Ghavamzadeh, Craig Boutilier:
Randomized Exploration in Generalized Linear Bandits. AISTATS 2020: 2066-2076 - [c71]Tong Yu, Branislav Kveton, Zheng Wen, Ruiyi Zhang, Ole J. Mengshoel:
Graphical Models Meet Bandits: A Variational Thompson Sampling Approach. ICML 2020: 10902-10912 - [c70]Craig Boutilier, Chih-Wei Hsu, Branislav Kveton, Martin Mladenov, Csaba Szepesvári, Manzil Zaheer:
Differentiable Meta-Learning of Bandit Policies. NeurIPS 2020 - [c69]Joey Hong, Branislav Kveton, Manzil Zaheer, Yinlam Chow, Amr Ahmed, Craig Boutilier:
Latent Bandits Revisited. NeurIPS 2020 - [i47]Craig Boutilier, Chih-Wei Hsu, Branislav Kveton, Martin Mladenov, Csaba Szepesvári, Manzil Zaheer:
Differentiable Bandit Exploration. CoRR abs/2002.06772 (2020) - [i46]Thanh Tan Nguyen, Ali Shameli, Yasin Abbasi-Yadkori, Anup Rao, Branislav Kveton:
Sample Efficient Graph-Based Optimization with Noisy Observations. CoRR abs/2006.02672 (2020) - [i45]Branislav Kveton, Martin Mladenov, Chih-Wei Hsu, Manzil Zaheer, Csaba Szepesvári, Craig Boutilier:
Differentiable Meta-Learning in Contextual Bandits. CoRR abs/2006.05094 (2020) - [i44]Joey Hong, Branislav Kveton, Manzil Zaheer, Yinlam Chow, Amr Ahmed:
Piecewise-Stationary Off-Policy Optimization. CoRR abs/2006.08236 (2020) - [i43]Joey Hong, Branislav Kveton, Manzil Zaheer, Yinlam Chow, Amr Ahmed, Craig Boutilier:
Latent Bandits Revisited. CoRR abs/2006.08714 (2020) - [i42]Tong Yu, Branislav Kveton, Zheng Wen, Ruiyi Zhang, Ole J. Mengshoel:
Influence Diagram Bandits: Variational Thompson Sampling for Structured Bandit Problems. CoRR abs/2007.04915 (2020) - [i41]Joey Hong, Branislav Kveton, Manzil Zaheer, Yinlam Chow, Amr Ahmed, Mohammad Ghavamzadeh, Craig Boutilier:
Non-Stationary Latent Bandits. CoRR abs/2012.00386 (2020)
2010 – 2019
- 2019
- [c68]Yang Cao, Zheng Wen, Branislav Kveton, Yao Xie:
Nearly Optimal Adaptive Procedure with Change Detection for Piecewise-Stationary Bandit. AISTATS 2019: 418-427 - [c67]Sumeet Katariya, Branislav Kveton, Zheng Wen, Vamsi K. Potluru:
Conservative Exploration using Interleaving. AISTATS 2019: 954-963 - [c66]Thanh Tan Nguyen, Ali Shameli, Yasin Abbasi-Yadkori, Anup Rao, Branislav Kveton:
Sample Efficient Graph-Based Optimization with Noisy Observations. AISTATS 2019: 3333-3341 - [c65]Branislav Kveton, Csaba Szepesvári, Sharan Vaswani, Zheng Wen, Tor Lattimore, Mohammad Ghavamzadeh:
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits. ICML 2019: 3601-3610 - [c64]Branislav Kveton, Csaba Szepesvári, Mohammad Ghavamzadeh, Craig Boutilier:
Perturbed-History Exploration in Stochastic Multi-Armed Bandits. IJCAI 2019: 2786-2793 - [c63]Chang Li, Branislav Kveton, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesvári, Masrour Zoghi:
BubbleRank: Safe Online Learning to Re-Rank via Implicit Click Feedback. UAI 2019: 196-206 - [c62]Branislav Kveton, Csaba Szepesvári, Mohammad Ghavamzadeh, Craig Boutilier:
Perturbed-History Exploration in Stochastic Linear Bandits. UAI 2019: 530-540 - [c61]Gaurush Hiranandani, Harvineet Singh, Prakhar Gupta, Iftikhar Ahamath Burhanuddin, Zheng Wen, Branislav Kveton:
Cascading Linear Submodular Bandits: Accounting for Position Bias and Diversity in Online Learning to Rank. UAI 2019: 722-732 - [i40]Branislav Kveton, Csaba Szepesvári, Mohammad Ghavamzadeh, Craig Boutilier:
Perturbed-History Exploration in Stochastic Multi-Armed Bandits. CoRR abs/1902.10089 (2019) - [i39]Branislav Kveton, Csaba Szepesvári, Mohammad Ghavamzadeh, Craig Boutilier:
Perturbed-History Exploration in Stochastic Linear Bandits. CoRR abs/1903.09132 (2019) - [i38]Chih-Wei Hsu, Branislav Kveton, Ofer Meshi, Martin Mladenov, Csaba Szepesvári:
Empirical Bayes Regret Minimization. CoRR abs/1904.02664 (2019) - [i37]Branislav Kveton, Saied Mahdian, S. Muthukrishnan, Zheng Wen, Yikun Xian:
Waterfall Bandits: Learning to Sell Ads Online. CoRR abs/1904.09404 (2019) - [i36]Branislav Kveton, Manzil Zaheer, Csaba Szepesvári, Lihong Li, Mohammad Ghavamzadeh, Craig Boutilier:
Randomized Exploration in Generalized Linear Bandits. CoRR abs/1906.08947 (2019) - [i35]Sharan Vaswani, Abbas Mehrabian, Audrey Durand, Branislav Kveton:
Old Dog Learns New Tricks: Randomized UCB for Bandit Problems. CoRR abs/1910.04928 (2019) - 2018
- [c60]Charles Chen, Sungchul Kim, Hung Bui, Ryan A. Rossi, Eunyee Koh, Branislav Kveton, Razvan C. Bunescu:
Predictive Analysis by Leveraging Temporal User Behavior and User Embeddings. CIKM 2018: 2175-2182 - [c59]Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan, Vishwa Vinay
, Zheng Wen:
Offline Evaluation of Ranking Policies with Click Models. KDD 2018: 1685-1694 - [c58]Tor Lattimore, Branislav Kveton, Shuai Li, Csaba Szepesvári:
TopRank: A practical algorithm for online stochastic ranking. NeurIPS 2018: 3949-3958 - [c57]Tong Yu, Branislav Kveton, Zheng Wen, Hung Hai Bui, Ole J. Mengshoel:
\mathttSpectralLeader : Online Spectral Learning for Single Topic Models. ECML/PKDD (2) 2018: 379-395 - [c56]Xiuyuan Lu, Zheng Wen, Branislav Kveton:
Efficient online recommendation via low-rank ensemble sampling. RecSys 2018: 460-464 - [c55]Branislav Kveton, S. Muthukrishnan, Hoa T. Vu, Yikun Xian:
Finding Subcube Heavy Hitters in Analytics Data Streams. WWW 2018: 1705-1714 - [i34]Yang Cao, Zheng Wen, Branislav Kveton, Yao Xie:
Nearly Optimal Adaptive Procedure for Piecewise-Stationary Bandit: a Change-Point Detection Approach. CoRR abs/1802.03692 (2018) - [i33]Shuai Li, Yasin Abbasi-Yadkori, Branislav Kveton, S. Muthukrishnan, Vishwa Vinay, Zheng Wen:
Offline Evaluation of Ranking Policies with Click Models. CoRR abs/1804.10488 (2018) - [i32]Sharan Vaswani, Branislav Kveton, Zheng Wen, Anup Rao, Mark Schmidt, Yasin Abbasi-Yadkori:
New Insights into Bootstrapping for Bandits. CoRR abs/1805.09793 (2018) - [i31]Sumeet Katariya, Branislav Kveton, Zheng Wen, Vamsi K. Potluru:
Conservative Exploration using Interleaving. CoRR abs/1806.00892 (2018) - [i30]Tor Lattimore, Branislav Kveton, Shuai Li, Csaba Szepesvári:
TopRank: A practical algorithm for online stochastic ranking. CoRR abs/1806.02248 (2018) - [i29]Branislav Kveton, Chang Li, Tor Lattimore, Ilya Markov, Maarten de Rijke, Csaba Szepesvári, Masrour Zoghi:
BubbleRank: Safe Online Learning to Rerank. CoRR abs/1806.05819 (2018) - [i28]Prakhar Gupta, Gaurush Hiranandani, Harvineet Singh, Branislav Kveton, Zheng Wen, Iftikhar Ahamath Burhanuddin:
Online Diverse Learning to Rank from Partial-Click Feedback. CoRR abs/1811.00911 (2018) - [i27]Branislav Kveton, Csaba Szepesvári, Zheng Wen, Mohammad Ghavamzadeh, Tor Lattimore:
Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits. CoRR abs/1811.05154 (2018) - 2017
- [c54]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Stochastic Rank-1 Bandits. AISTATS 2017: 392-401 - [c53]Sharan Vaswani, Branislav Kveton, Zheng Wen, Mohammad Ghavamzadeh, Laks V. S. Lakshmanan, Mark Schmidt:
Model-Independent Online Learning for Influence Maximization. ICML 2017: 3530-3539 - [c52]Masrour Zoghi, Tomás Tunys, Mohammad Ghavamzadeh, Branislav Kveton, Csaba Szepesvári, Zheng Wen:
Online Learning to Rank in Stochastic Click Models. ICML 2017: 4199-4208 - [c51]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Bernoulli Rank-1 Bandits for Click Feedback. IJCAI 2017: 2001-2007 - [c50]Zheng Wen, Branislav Kveton, Michal Valko, Sharan Vaswani:
Online Influence Maximization under Independent Cascade Model with Semi-Bandit Feedback. NIPS 2017: 3022-3032 - [c49]Tong Yu, Branislav Kveton, Ole J. Mengshoel:
Thompson Sampling for Optimizing Stochastic Local Search. ECML/PKDD (1) 2017: 493-510 - [c48]Shi Zong, Branislav Kveton, Shlomo Berkovsky, Azin Ashkan, Zheng Wen:
Get to the Bottom: Causal Analysis for User Modeling. UMAP 2017: 256-264 - [c47]Shi Zong, Branislav Kveton, Shlomo Berkovsky, Azin Ashkan, Nikos Vlassis, Zheng Wen:
Does Weather Matter?: Causal Analysis of TV Logs. WWW (Companion Volume) 2017: 883-884 - [i26]Shi Zong, Branislav Kveton, Shlomo Berkovsky, Azin Ashkan, Nikos Vlassis, Zheng Wen:
Does Weather Matter? Causal Analysis of TV Logs. CoRR abs/1701.08716 (2017) - [i25]Sharan Vaswani, Branislav Kveton, Zheng Wen, Mohammad Ghavamzadeh, Laks V. S. Lakshmanan, Mark Schmidt:
Diffusion Independent Semi-Bandit Influence Maximization. CoRR abs/1703.00557 (2017) - [i24]Mohammad Ghavamzadeh, Branislav Kveton, Csaba Szepesvári, Tomás Tunys, Zheng Wen, Masrour Zoghi:
Online Learning to Rank in Stochastic Click Models. CoRR abs/1703.02527 (2017) - [i23]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Bernoulli Rank-1 Bandits for Click Feedback. CoRR abs/1703.06513 (2017) - [i22]Branislav Kveton, S. Muthukrishnan, Hoa T. Vu:
Finding Subcube Heavy Hitters in Data Streams. CoRR abs/1708.05159 (2017) - [i21]Tong Yu, Branislav Kveton, Zheng Wen, Hung Hai Bui, Ole J. Mengshoel:
SpectralFPL: Online Spectral Learning for Single Topic Models. CoRR abs/1709.07172 (2017) - [i20]Branislav Kveton, Csaba Szepesvári, Anup Rao, Zheng Wen, Yasin Abbasi-Yadkori, S. Muthukrishnan:
Stochastic Low-Rank Bandits. CoRR abs/1712.04644 (2017) - 2016
- [j4]Branislav Kveton, Shlomo Berkovsky:
Minimal Interaction Content Discovery in Recommender Systems. ACM Trans. Interact. Intell. Syst. 6(2): 15:1-15:25 (2016) - [c46]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Zheng Wen:
DCM Bandits: Learning to Rank with Multiple Clicks. ICML 2016: 1215-1224 - [c45]Suvash Sedhain, Hung Hai Bui, Jaya Kawale, Nikos Vlassis, Branislav Kveton, Aditya Krishna Menon, Trung Bui, Scott Sanner:
Practical Linear Models for Large-Scale One-Class Collaborative Filtering. IJCAI 2016: 3854-3860 - [c44]Branislav Kveton, Hung Hai Bui, Mohammad Ghavamzadeh, Georgios Theocharous, S. Muthukrishnan, Siqi Sun:
Graphical Model Sketch. ECML/PKDD (1) 2016: 81-97 - [c43]Shi Zong, Hao Ni, Kenny Sung, Nan Rosemary Ke, Zheng Wen, Branislav Kveton:
Cascading Bandits for Large-Scale Recommendation Problems. UAI 2016 - [i19]Branislav Kveton, Hung Hai Bui, Mohammad Ghavamzadeh, Georgios Theocharous, S. Muthukrishnan, Siqi Sun:
Graphical Model Sketch. CoRR abs/1602.03105 (2016) - [i18]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Zheng Wen:
DCM Bandits: Learning to Rank with Multiple Clicks. CoRR abs/1602.03146 (2016) - [i17]Shi Zong, Hao Ni, Kenny Sung, Nan Rosemary Ke, Zheng Wen, Branislav Kveton:
Cascading Bandits for Large-Scale Recommendation Problems. CoRR abs/1603.05359 (2016) - [i16]Zheng Wen, Branislav Kveton, Michal Valko:
Influence Maximization with Semi-Bandit Feedback. CoRR abs/1605.06593 (2016) - [i15]Sumeet Katariya, Branislav Kveton, Csaba Szepesvári, Claire Vernade, Zheng Wen:
Stochastic Rank-1 Bandits. CoRR abs/1608.03023 (2016) - 2015
- [j3]Salman Salamatian, Amy Zhang, Flávio du Pin Calmon, Sandilya Bhamidipati, Nadia Fawaz, Branislav Kveton, Pedro Oliveira, Nina Taft:
Managing Your Private and Public Data: Bringing Down Inference Attacks Against Your Privacy. IEEE J. Sel. Top. Signal Process. 9(7): 1240-1255 (2015) - [j2]Sandilya Bhamidipati, Nadia Fawaz, Branislav Kveton, Amy Zhang:
PriView: Personalized Media Consumption Meets Privacy against Inference Attacks. IEEE Softw. 32(4): 53-59 (2015) - [c42]Branislav Kveton, Zheng Wen, Azin Ashkan, Csaba Szepesvári:
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits. AISTATS 2015 - [c41]Branislav Kveton, Csaba Szepesvári, Zheng Wen, Azin Ashkan:
Cascading Bandits: Learning to Rank in the Cascade Model. ICML 2015: 767-776 - [c40]Zheng Wen, Branislav Kveton, Azin Ashkan:
Efficient Learning in Large-Scale Combinatorial Semi-Bandits. ICML 2015: 1113-1122 - [c39]Azin Ashkan, Branislav Kveton, Shlomo Berkovsky, Zheng Wen:
Optimal Greedy Diversity for Recommendation. IJCAI 2015: 1742-1748 - [c38]Branislav Kveton, Shlomo Berkovsky:
Minimal Interaction Search in Recommender Systems. IUI 2015: 236-246 - [c37]Jaya Kawale, Hung Hai Bui, Branislav Kveton, Long Tran-Thanh, Sanjay Chawla:
Efficient Thompson Sampling for Online Matrix-Factorization Recommendation. NIPS 2015: 1297-1305 - [c36]Branislav Kveton, Zheng Wen, Azin Ashkan, Csaba Szepesvári:
Combinatorial Cascading Bandits. NIPS 2015: 1450-1458 - [i14]Branislav Kveton, Csaba Szepesvári, Zheng Wen, Azin Ashkan:
Cascading Bandits. CoRR abs/1502.02763 (2015) - [i13]Branislav Kveton, Zheng Wen, Azin Ashkan, Csaba Szepesvári:
Combinatorial Cascading Bandits. CoRR abs/1507.04208 (2015) - 2014
- [c35]Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, S. Muthukrishnan:
Large-Scale Optimistic Adaptive Submodularity. AAAI 2014: 1816-1823 - [c34]Michal Valko, Rémi Munos, Branislav Kveton, Tomás Kocák:
Spectral Bandits for Smooth Graph Functions. ICML 2014: 46-54 - [c33]Azin Ashkan, Branislav Kveton, Shlomo Berkovsky, Zheng Wen:
Diversified Utility Maximization for Recommendations. RecSys Posters 2014 - [c32]Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, Brian Eriksson:
Matroid Bandits: Fast Combinatorial Optimization with Learning. UAI 2014: 420-429 - [c31]Salman Salamatian, Nadia Fawaz, Branislav Kveton, Nina Taft:
SPPM: Sparse Privacy Preserving Mappings. UAI 2014: 712-721 - [i12]Branislav Kveton, Zheng Wen, Azin Ashkan, Hoda Eydgahi, Brian Eriksson:
Matroid Bandits: Fast Combinatorial Optimization with Learning. CoRR abs/1403.5045 (2014) - [i11]Branislav Kveton, Zheng Wen, Azin Ashkan, Michal Valko:
Learning to Act Greedily: Polymatroid Semi-Bandits. CoRR abs/1405.7752 (2014) - [i10]Zheng Wen, Azin Ashkan, Hoda Eydgahi, Branislav Kveton:
Efficient Learning in Large-Scale Combinatorial Semi-Bandits. CoRR abs/1406.7443 (2014) - [i9]Salman Salamatian, Amy Zhang, Flávio du Pin Calmon, Sandilya Bhamidipati, Nadia Fawaz, Branislav Kveton, Pedro Oliveira, Nina Taft:
Managing your Private and Public Data: Bringing down Inference Attacks against your Privacy. CoRR abs/1408.3698 (2014) - [i8]Branislav Kveton, Zheng Wen, Azin Ashkan, Csaba Szepesvári:
Tight Regret Bounds for Stochastic Combinatorial Semi-Bandits. CoRR abs/1410.0949 (2014) - [i7]Azin Ashkan, Branislav Kveton, Shlomo Berkovsky, Zheng Wen:
DUM: Diversity-Weighted Utility Maximization for Recommendations. CoRR abs/1411.3650 (2014) - 2013
- [c30]Branislav Kveton, Georgios Theocharous:
Structured Kernel-Based Reinforcement Learning. AAAI 2013 - [c29]Branislav Kveton, Michal Valko:
Learning from a single labeled face and a stream of unlabeled data. FG 2013: 1-8 - [c28]Salman Salamatian, Amy Zhang, Flávio du Pin Calmon, Sandilya Bhamidipati, Nadia Fawaz, Branislav Kveton, Pedro Oliveira, Nina Taft:
How to hide the elephant- or the donkey- in the room: Practical privacy against statistical inference for large data. GlobalSIP 2013: 269-272 - [c27]Zheng Wen, Branislav Kveton, Brian Eriksson, Sandilya Bhamidipati:
Sequential Bayesian Search. ICML (2) 2013: 226-234 - [c26]Diana Joumblatt, Jaideep Chandrashekar, Branislav Kveton, Nina Taft, Renata Teixeira:
Predicting user dissatisfaction with Internet application performance at end-hosts. INFOCOM 2013: 235-239 - [c25]Victor Gabillon, Branislav Kveton, Zheng Wen, Brian Eriksson, S. Muthukrishnan:
Adaptive Submodular Maximization in Bandit Setting. NIPS 2013: 2697-2705 - 2012
- [c24]Branislav Kveton, Georgios Theocharous:
Kernel-Based Reinforcement Learning on Representative States. AAAI 2012 - [c23]