{"id":670011,"date":"2020-06-26T14:10:27","date_gmt":"2020-06-26T21:10:27","guid":{"rendered":"https:\/\/www.microsoft.com\/en-us\/research\/?post_type=msr-event&p=670011"},"modified":"2025-08-06T11:52:43","modified_gmt":"2025-08-06T18:52:43","slug":"icml-2020","status":"publish","type":"msr-event","link":"https:\/\/www.microsoft.com\/en-us\/research\/event\/icml-2020\/","title":{"rendered":"Microsoft at ICML 2020"},"content":{"rendered":"\n\n
Website:<\/strong> ICML 2020 (opens in new tab)<\/span><\/a>Opens in a new tab<\/span><\/p>\n Microsoft is proud to be a Gold sponsor of the 37th International Conference on Machine Learning (opens in new tab)<\/span><\/a> (ICML), as well as Diamond sponsors at the 1st Women in Machine Learning Un-Workshop (opens in new tab)<\/span><\/a> and Platinum sponsors of the 4th Queer in AI Workshop (opens in new tab)<\/span><\/a>. We have over 50 papers accepted to the conference, and you can find details of our publications on the Accepted papers<\/a> and Workshops<\/a> tabs.<\/p>\n ICML President: John Langford<\/a> 05:00 \u2013 06:45 PDT & 16:00 \u2013 17:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 07:00 \u2013 07:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 09:00 \u2013 09:45 PDT 09:00 \u2013 09:45 PDT 11:00 \u2013 11:45 PDT 11:00 \u2013 11:45 PDT 12:00 \u2013 12:45 PDT 13:00 \u2013 13:45 PDT 18:00 \u2013 18:45 PDT 18:00 \u2013 18:45 PDT 18:00 \u2013 18:45 PDT 18:00 \u2013 18:45 PDT 19:00 \u2013 19:45 PDT 19:00 \u2013 19:45 PDT 19:00 \u2013 19:45 PDT 19:00 \u2013 19:45 PDT 19:00 \u2013 19:45 PDT 19:00 \u2013 19:45 PDT 19:00 \u2013 19:45 PDT 20:00 \u2013 20:45 PDT 20:00 \u2013 20:45 PDT 20:00 \u2013 20:45 PDT 21:00 \u2013 21:45 PDT 21:00 \u2013 21:45 PDT 21:00 \u2013 21:45 PDT 21:00 \u2013 21:45 PDT 22:00 \u2013 22:45 PDT 22:00 \u2013 22:45 PDT 22:00 \u2013 22:45 PDT 01:00 \u2013 01:45 PDT 01:00 \u2013 01:45 PDT 05:00 \u2013 05:45 PDT 05:00 \u2013 05:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 08:00 \u2013 08:45 PDT 10:00 \u2013 10:45 PDT 10:00 \u2013 10:45 PDTCommittee chairs<\/h2>\n
\nICML Board Members: Hal Daum\u00e9 III<\/a>, Hanna Wallach<\/a>
\nProgram Co-chair: Hal Daum\u00e9 III<\/a><\/p>\nInvited speaker<\/h2>\n
Tuesday, July 14<\/h3>\n
\nDoing Some Good with Machine Learning<\/strong>
\nInvited Speaker: Lester Mackey<\/a>Opens in a new tab<\/span><\/p>\nTuesday, July 14<\/h2>\n
\n2nd session: 20:00 \u2013 20:45 PDT
\nNGBoost: Natural Gradient Boosting for Probabilistic Prediction<\/strong><\/a>
\nTony Duan<\/strong>, Anand Avati, Daisy Ding, Khanh K. Thai, Sanjay Basu, Andrew Ng, Alejandro Schuler<\/p>\n
\n2nd session: 18:00 \u2013 18:45 PDT
\nOnline Learning for Active Cache Synchronization<\/strong><\/a>
\nAndrey Kolobov<\/a>, Sebastien Bubeck<\/a>, Julian Zimmert<\/p>\n
\n2nd session: 19:00 \u2013 19:45 PDT
\nRandomized Smoothing of All Shapes and Sizes<\/strong><\/a>
\nGreg Yang<\/a>, Tony Duan<\/strong>, J. Edward Hu<\/strong>, Hadi Salman<\/strong>, Ilya Razenshteyn<\/a>, Jerry Li<\/a><\/p>\n
\n2nd session: 20:00 \u2013 20:45 PDT
\nPrivate Reinforcement Learning with PAC and Regret Guarantees<\/strong><\/a>
\nGiuseppe Vietri, Borja de Balle Pigem, Akshay Krishnamurthy<\/a>, Steven Wu<\/p>\n
\n2nd session: 18:00 \u2013 18:45 PDT
\nScalable Nearest Neighbor Search for Optimal Transport<\/strong><\/a>
\nArturs Backurs, Yihe Dong<\/strong>, Piotr Indyk, Ilya Razenshteyn<\/a>, Tal Wagner<\/p>\n
\n2nd session: 19:00 \u2013 19:45 PDT
\nCombinatorial Pure Exploration for Dueling Bandit<\/strong><\/a>
\nWei Chen<\/a>, Yihan Du, Longbo Huang, Haoyu Zhao<\/p>\n
\n2nd session: 19:00 \u2013 19:45 PDT
\nDistance Metric Learning with Joint Representation Diversification<\/strong><\/a>
\nXu Chu, Yang Lin, Xiting Wang<\/a>, Xin Gao, Qi Tong, Hailong Yu, Yasha Wang<\/p>\n
\n2nd session: 19:00 \u2013 19:45 PDT
\nEfficient Domain Generalization via Common-Specific Low-Rank Decomposition<\/strong><\/a>
\nVihari Piratla<\/strong>, Praneeth Netrapalli<\/a>, Sunita Sarawagi<\/p>\n
\n2nd session: 18:00 \u2013 18:45 PDT
\nFaster Graph Embeddings via Coarsening<\/strong><\/a>
\nMatthew Fahrbach, Gramoz Goranci, Sushant Sachdeva, Richard Peng, Chi Wang<\/a><\/p>\n
\n2nd session: 18:00 \u2013 18:45 PDT
\nWhat is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?<\/strong><\/a>
\nChi Jin, Praneeth Netrapalli<\/a>, Michael Jordan<\/p>\n
\n2nd session: 19:00 \u2013 19:45 PDT
\nAn end-to-end approach for the verification problem: learning the right distance<\/strong><\/a>
\nJoao Monteiro, Isabela Albuquerque, Jahangir Alam, R Devon Hjelm<\/a>, Tiago Falk<\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nWorking Memory Graphs<\/strong><\/a>
\nRicky Loynd<\/a>, Roland Fernandez<\/a>, Asli Celikyilmaz<\/a>, Adith Swaminathan<\/a>, Matthew Hausknecht<\/a><\/p>\n
\n2nd session: 19:00 \u2013 19:45 PDT
\nInformative Dropout for Robust Representation Learning: A Shape-bias Perspective<\/strong><\/a>
\nBaifeng Shi, Dinghuai Zhang, Qi Dai<\/a>, Jingdong Wang<\/a>, Zhanxing Zhu, Yadong Mu<\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nNear-optimal Sample Complexity Bounds for Learning Latent\u00a0k\u2212polytopes and applications to Ad-Mixtures<\/strong><\/a>
\nChiranjib Bhattacharyya, Ravindran Kannan<\/a><\/p>\n
\n2nd session: 19:00 \u2013 19:45 PDT
\nDifferentially Private Set Union<\/strong><\/a>
\nPankaj Gulhane<\/strong>, Sivakanth Gopi<\/a>, Janardhan Kulkarni<\/a>, Judy Hanwen Shen<\/strong>, Milad Shokouhi<\/a>, Sergey Yekhanin<\/a><\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nDiscount Factor as a Regularizer in Reinforcement Learning<\/strong><\/a>
\nRon Amit, Kamil Ciosek<\/a>, Ron Meir<\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nDROCC: Deep Robust One-Class Classification<\/strong><\/a>
\nSachin Goyal<\/strong>, Aditi Raghunathan, Moksh Jain, Harsha Vardhan Simhadri<\/a>, Prateek Jain<\/a><\/p>\n
\n2nd session: 20:00 \u2013 20:45 PDT
\nFeature Quantization Improves GAN Training<\/strong><\/a>
\nYang Zhao, Chunyuan Li<\/a>, Ping Yu, Jianfeng Gao<\/a>, Changyou Chen<\/p>\n
\n2nd session: 22:00 \u2013 22:45 PDT
\nHow Good is the Bayes Posterior in Deep Neural Networks Really<\/strong><\/a>
\nFlorian Wenzel, Kevin Roth, Bastiaan S. Veeling, Jakub Swiatkowski, Linh Tran, Stephan Mandt, Jasper Snoek, Tim Salimans, Rodolphe Jenatton, Sebastian Nowozin<\/a><\/p>\n
\n2nd session: 22:00 \u2013 22:45 PDT
\nOptimization and Analysis of the pAp@k Metric for Recommender Systems<\/strong><\/a>
\nGaurush Hiranandani, Warut Vijitbenjaronk, Sanmi Koyejo, Prateek Jain<\/a><\/p>\n
\n2nd session: 22:00 \u2013 22:45 PDT
\nBandits with Adversarial Scaling<\/strong><\/a>
\nThodoris Lykouris<\/a>, Vahab Mirrokni, Renato Leme<\/p>\n
\n2nd session: July 15 | 01:00 \u2013 01:45 PDT
\nTaskNorm: Rethinking Batch Normalization for Meta-Learning<\/strong><\/a>
\nJohn Bronskill, Jonathan Gordon, James Requeima, Sebastian Nowozin<\/a>, Richard E. Turner<\/p>\n
\n2nd session: July 15 | 01:00 \u2013 01:45 PDT
\nGNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulation<\/strong><\/a>
\nMarc Brockschmidt<\/a><\/p>\n
\nOnline Learning for Active Cache Synchronization<\/strong><\/a>
\nAndrey Kolobov<\/a>, Sebastien Bubeck<\/a>, Julian Zimmert<\/p>\n
\nScalable Nearest Neighbor Search for Optimal Transport<\/strong><\/a>
\nArturs Backurs, Yihe Dong<\/strong>, Piotr Indyk, Ilya Razenshteyn<\/a>, Tal Wagner<\/p>\n
\nFaster Graph Embeddings via Coarsening<\/strong><\/a>
\nMatthew Fahrbach, Gramoz Goranci, Sushant Sachdeva, Richard Peng, Chi Wang<\/a><\/p>\n
\nWhat is Local Optimality in Nonconvex-Nonconcave Minimax Optimization?<\/strong><\/a>
\nChi Jin, Praneeth Netrapalli<\/a>, Michael Jordan<\/p>\n
\nRandomized Smoothing of All Shapes and Sizes<\/strong><\/a>
\nGreg Yang<\/a>, Tony Duan<\/strong>, J. Edward Hu<\/strong>, Hadi Salman<\/strong>, Ilya Razenshteyn<\/a>, Jerry Li<\/a><\/p>\n
\nAn end-to-end approach for the verification problem: learning the right distance<\/strong><\/a>
\nJoao Monteiro, Isabela Albuquerque, Jahangir Alam, R Devon Hjelm<\/a>, Tiago Falk<\/p>\n
\nCombinatorial Pure Exploration for Dueling Bandit<\/strong><\/a>
\nWei Chen<\/a>, Yihan Du, Longbo Huang, Haoyu Zhao<\/p>\n
\nDistance Metric Learning with Joint Representation Diversification<\/strong><\/a>
\nXu Chu, Yang Lin, Xiting Wang<\/a>, Xin Gao, Qi Tong, Hailong Yu, Yasha Wang<\/p>\n
\nEfficient Domain Generalization via Common-Specific Low-Rank Decomposition<\/strong><\/a>
\nVihari Piratla<\/strong>, Praneeth Netrapalli<\/a>, Sunita Sarawagi<\/p>\n
\nInformative Dropout for Robust Representation Learning: A Shape-bias Perspective<\/strong><\/a>
\nBaifeng Shi, Dinghuai Zhang, Qi Dai<\/a>, Jingdong Wang<\/a>, Zhanxing Zhu, Yadong Mu<\/p>\n
\nDifferentially Private Set Union<\/strong><\/a>
\nPankaj Gulhane<\/strong>, Sivakanth Gopi<\/a>, Janardhan Kulkarni<\/a>, Judy Hanwen Shen<\/strong>, Milad Shokouhi<\/a>, Sergey Yekhanin<\/a><\/p>\n
\nNGBoost: Natural Gradient Boosting for Probabilistic Prediction<\/strong><\/a>
\nTony Duan<\/strong>, Anand Avati, Daisy Ding, Khanh K. Thai, Sanjay Basu, Andrew Ng, Alejandro Schuler<\/p>\n
\nPrivate Reinforcement Learning with PAC and Regret Guarantees<\/strong><\/a>
\nGiuseppe Vietri, Borja de Balle Pigem, Akshay Krishnamurthy<\/a>, Steven Wu<\/p>\n
\nFeature Quantization Improves GAN Training<\/strong><\/a>
\nYang Zhao, Chunyuan Li<\/a>, Ping Yu, Jianfeng Gao<\/a>, Changyou Chen<\/p>\n
\nWorking Memory Graphs<\/strong><\/a>
\nRicky Loynd<\/a>, Roland Fernandez<\/a>, Asli Celikyilmaz<\/a>, Adith Swaminathan<\/a>, Matthew Hausknecht<\/a><\/p>\n
\nNear-optimal Sample Complexity Bounds for Learning Latent\u00a0k\u2212polytopes and applications to Ad-Mixtures<\/strong><\/a>
\nChiranjib Bhattacharyya, Ravindran Kannan<\/a><\/p>\n
\nDiscount Factor as a Regularizer in Reinforcement Learning<\/strong><\/a>
\nRon Amit, Kamil Ciosek<\/a>, Ron Meir<\/p>\n
\nDROCC: Deep Robust One-Class Classification<\/strong><\/a>
\nSachin Goyal<\/strong>, Aditi Raghunathan, Moksh Jain, Harsha Vardhan Simhadri<\/a>, Prateek Jain<\/a><\/p>\n
\nOptimization and Analysis of the pAp@k Metric for Recommender Systems<\/strong><\/a>
\nGaurush Hiranandani, Warut Vijitbenjaronk, Sanmi Koyejo, Prateek Jain<\/a><\/p>\n
\nBandits with Adversarial Scaling<\/strong><\/a>
\nThodoris Lykouris<\/a>, Vahab Mirrokni, Renato Leme<\/p>\n
\nHow Good is the Bayes Posterior in Deep Neural Networks Really<\/strong><\/a>
\nFlorian Wenzel, Kevin Roth, Bastiaan S. Veeling, Jakub Swiatkowski, Linh Tran, Stephan Mandt, Jasper Snoek, Tim Salimans, Rodolphe Jenatton, Sebastian Nowozin<\/a><\/p>\n
\nWednesday, July 15<\/h2>\n
\nGNN-FiLM: Graph Neural Networks with Feature-wise Linear Modulation<\/strong><\/a>
\nMarc Brockschmidt<\/a><\/p>\n
\nTaskNorm: Rethinking Batch Normalization for Meta-Learning<\/strong><\/a>
\nJohn Bronskill, Jonathan Gordon, James Requeima, Sebastian Nowozin<\/a>, Richard E. Turner<\/p>\n
\n2nd session: 16:00 \u2013 16:45 PDT
\nAdaptive Estimator Selection for Off-Policy Evaluation<\/strong><\/a>
\nYi Su, Pavithra Srinath<\/a>, Akshay Krishnamurthy<\/a><\/p>\n
\n2nd session: 16:00 \u2013 16:45 PDT
\nPrivately Learning Markov Random Fields<\/strong><\/a>
\nGautam Kamath, Janardhan Kulkarni<\/a>, Steven Wu, Huanyu Zhang<\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nThe Non-IID Data Quagmire of Decentralized Machine Learning<\/strong><\/a>
\nKevin Hsieh<\/strong>, Amar Phanishayee<\/a>, Onur Mutlu, Phillip Gibbons<\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nAlleviating Privacy Attacks via Causal Learning<\/strong><\/a>
\nShruti Tople<\/a>, Amit Sharma<\/a>, Aditya Nori<\/a><\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\n(Locally) Differentially Private Combinatorial Semi-Bandits<\/strong><\/a>
\nXiaoyu Chen, Kai Zheng, Zixin Zhou, Yunchang Yang, Wei Chen<\/a>, Liwei Wang<\/p>\n
\n2nd session: 20:00 \u2013 20:45 PDT
\nThe Usual Suspects? Reassessing Blame for VAE Posterior Collapse<\/strong><\/a>
\nBin Dai, Ziyu Wang, David Wipf<\/strong><\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nSingle Point Transductive Prediction<\/strong><\/a>
\nNilesh Tripuraneni, Lester Mackey<\/a><\/p>\n
\n2nd session: 21:00 \u2013 21:45 PDT
\nLearning Calibratable Policies using Programmatic Style-Consistency<\/strong><\/a>