ICML
Collection
Accepted papers for ICML (International Conference on Machine Learning), one dataset per year. • 13 items • Updated
title stringlengths 12 143 | paper_url stringlengths 44 58 | authors listlengths 1 13 | type stringclasses 0
values | primary_area stringclasses 0
values | abstract large_stringlengths 288 4.43k | keywords listlengths 0 0 | TL;DR large_stringclasses 0
values | submission_number int64 1 773 | arxiv_id stringlengths 10 10 ⌀ | arxiv_id_source stringclasses 2
values | embedding listlengths 768 768 |
|---|---|---|---|---|---|---|---|---|---|---|---|
AReS and MaRS Adversarial and MMD-Minimizing Regression for SDEs | https://proceedings.mlr.press/v97/abbati19a.html | [
"Gabriele Abbati",
"Philippe Wenk",
"Michael A. Osborne",
"Andreas Krause",
"Bernhard Schölkopf",
"Stefan Bauer"
] | null | null | Stochastic differential equations are an important modeling class in many disciplines. Consequently, there exist many methods relying on various discretization and numerical integration schemes. In this paper, we propose a novel, probabilistic model for estimating the drift and diffusion given noisy observations of the... | [] | null | 1 | 1902.08480 | title_snapshot | [
-0.01475281361490488,
0.02767331153154373,
-0.010267019271850586,
0.05629995837807655,
0.05450527369976044,
0.04201443865895271,
0.03370289131999016,
0.006314247380942106,
-0.026731790974736214,
-0.06461016833782196,
0.00764450803399086,
-0.007380622439086437,
-0.04433220252394676,
-0.0096... |
Dynamic Weights in Multi-Objective Deep Reinforcement Learning | https://proceedings.mlr.press/v97/abels19a.html | [
"Axel Abels",
"Diederik Roijers",
"Tom Lenaerts",
"Ann Nowé",
"Denis Steckelmacher"
] | null | null | Many real-world decision problems are characterized by multiple conflicting objectives which must be balanced based on their relative importance. In the dynamic weights setting the relative importance changes over time and specialized algorithms that deal with such change, such as a tabular Reinforcement Learning (RL) ... | [] | null | 2 | 1809.07803 | title_snapshot | [
-0.06123773753643036,
-0.013469628989696503,
-0.006091605871915817,
0.034519731998443604,
0.028802571818232536,
0.031595628708601,
-0.006737292744219303,
0.007433074526488781,
-0.05597781017422676,
-0.05052630230784416,
-0.026796218007802963,
0.018374165520071983,
-0.07239469140768051,
-0.... |
MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing | https://proceedings.mlr.press/v97/abu-el-haija19a.html | [
"Sami Abu-El-Haija",
"Bryan Perozzi",
"Amol Kapoor",
"Nazanin Alipourfard",
"Kristina Lerman",
"Hrayr Harutyunyan",
"Greg Ver Steeg",
"Aram Galstyan"
] | null | null | Existing popular methods for semi-supervised learning with Graph Neural Networks (such as the Graph Convolutional Network) provably cannot learn a general class of neighborhood mixing relationships. To address this weakness, we propose a new model, MixHop, that can learn these relationships, including difference operat... | [] | null | 3 | 1905.00067 | title_snapshot | [
0.04124806076288223,
-0.04907359555363655,
0.0012405433226376772,
0.05263511463999748,
0.018444178625941277,
0.03627140447497368,
0.019593019038438797,
0.004926078487187624,
-0.0038921176455914974,
-0.06383872777223587,
0.0034328403417021036,
-0.012852258048951626,
-0.07533838599920273,
0.... |
Communication-Constrained Inference and the Role of Shared Randomness | https://proceedings.mlr.press/v97/acharya19a.html | [
"Jayadev Acharya",
"Clement Canonne",
"Himanshu Tyagi"
] | null | null | A central server needs to perform statistical inference based on samples that are distributed over multiple users who can each send a message of limited length to the center. We study problems of distribution learning and identity testing in this distributed inference setting and examine the role of shared randomness a... | [] | null | 4 | 1905.08302 | title_judge | [
0.0036378460936248302,
-0.0038676925469189882,
-0.03272268548607826,
0.0800064280629158,
0.03515314310789108,
0.008345500566065311,
0.03516628220677376,
0.007164329290390015,
-0.0062719425186514854,
-0.04561731591820717,
0.025469446554780006,
-0.023213587701320648,
-0.06913220882415771,
0.... |
Distributed Learning with Sublinear Communication | https://proceedings.mlr.press/v97/acharya19b.html | [
"Jayadev Acharya",
"Chris De Sa",
"Dylan Foster",
"Karthik Sridharan"
] | null | null | In distributed statistical learning, $N$ samples are split across $m$ machines and a learner wishes to use minimal communication to learn as well as if the examples were on a single machine. This model has received substantial interest in machine learning due to its scalability and potential for parallel speedup. Howev... | [] | null | 5 | 1902.11259 | title_snapshot | [
-0.021587898954749107,
-0.03199276328086853,
-0.0012688988354057074,
0.012993289157748222,
0.0276494100689888,
0.020025186240673065,
0.0534999780356884,
-0.014428995549678802,
-0.004912131931632757,
-0.05558633431792259,
0.009769429452717304,
-0.0189049169421196,
-0.07537578791379929,
0.02... |
Communication Complexity in Locally Private Distribution Estimation and Heavy Hitters | https://proceedings.mlr.press/v97/acharya19c.html | [
"Jayadev Acharya",
"Ziteng Sun"
] | null | null | We consider the problems of distribution estimation, and heavy hitter (frequency) estimation under privacy, and communication constraints. While the constraints have been studied separately, optimal schemes for one are sub-optimal for the other. We propose a sample-optimal $\eps$-locally differentially private (LDP) sc... | [] | null | 6 | 1905.11888 | title_snapshot | [
-0.016130002215504646,
0.008072704076766968,
0.0022999283391982317,
0.04908524081110954,
0.0366847924888134,
0.028917308896780014,
0.021175777539610863,
-0.02164597064256668,
-0.010404601693153381,
-0.043140798807144165,
0.032812103629112244,
-0.011841246858239174,
-0.054935261607170105,
-... |
Learning Models from Data with Measurement Error: Tackling Underreporting | https://proceedings.mlr.press/v97/adams19a.html | [
"Roy Adams",
"Yuelong Ji",
"Xiaobin Wang",
"Suchi Saria"
] | null | null | Measurement error in observational datasets can lead to systematic bias in inferences based on these datasets. As studies based on observational data are increasingly used to inform decisions with real-world impact, it is critical that we develop a robust set of techniques for analyzing and adjusting for these biases. ... | [] | null | 7 | 1901.09060 | title_snapshot | [
0.0037026198115199804,
0.01595727913081646,
-0.04886854439973831,
0.01095893606543541,
0.051226649433374405,
0.03163708373904228,
0.06759265065193176,
0.004640278872102499,
-0.01882386952638626,
-0.03743262588977814,
0.016706207767128944,
-0.009080409072339535,
-0.06695521622896194,
-0.020... |
TibGM: A Transferable and Information-Based Graphical Model Approach for Reinforcement Learning | https://proceedings.mlr.press/v97/adel19a.html | [
"Tameem Adel",
"Adrian Weller"
] | null | null | One of the challenges to reinforcement learning (RL) is scalable transferability among complex tasks. Incorporating a graphical model (GM), along with the rich family of related methods, as a basis for RL frameworks provides potential to address issues such as transferability, generalisation and exploration. Here we pr... | [] | null | 8 | null | null | [
-0.03973774239420891,
-0.028840720653533936,
-0.0003902135940734297,
0.010376001708209515,
0.029929162934422493,
-0.004094300325959921,
0.017187807708978653,
0.003675706684589386,
-0.017560606822371483,
-0.03998705744743347,
-0.008465657941997051,
0.05053151771426201,
-0.08467479050159454,
... |
PAC Learnability of Node Functions in Networked Dynamical Systems | https://proceedings.mlr.press/v97/adiga19a.html | [
"Abhijin Adiga",
"Chris J Kuhlman",
"Madhav Marathe",
"S Ravi",
"Anil Vullikanti"
] | null | null | We consider the PAC learnability of the local functions at the vertices of a discrete networked dynamical system, assuming that the underlying network is known. Our focus is on the learnability of threshold functions. We show that several variants of threshold functions are PAC learnable and provide tight bounds on the... | [] | null | 9 | null | null | [
-0.03356032818555832,
-0.03384532406926155,
-0.015024405904114246,
0.06329545378684998,
0.03417431190609932,
0.028963129967451096,
0.016521872952580452,
-0.007647205609828234,
-0.01691633090376854,
-0.02353443205356598,
0.03618233650922775,
0.0066099269315600395,
-0.06770040839910507,
0.00... |
Static Automatic Batching In TensorFlow | https://proceedings.mlr.press/v97/agarwal19a.html | [
"Ashish Agarwal"
] | null | null | Dynamic neural networks are becoming increasingly common, and yet it is hard to implement them efficiently. On-the-fly operation batching for such models is sub-optimal and suffers from run time overheads, while writing manually batched versions can be hard and error-prone. To address this we extend TensorFlow with pfo... | [] | null | 10 | null | null | [
-0.027163801714777946,
-0.04578056558966637,
-0.013532647863030434,
0.0036484613083302975,
0.017245884984731674,
0.05002356320619583,
0.02000141330063343,
0.02031344547867775,
-0.04729184880852699,
-0.04810208082199097,
-0.009427351877093315,
-0.027539731934666634,
-0.08110728859901428,
0.... |
Efficient Full-Matrix Adaptive Regularization | https://proceedings.mlr.press/v97/agarwal19b.html | [
"Naman Agarwal",
"Brian Bullins",
"Xinyi Chen",
"Elad Hazan",
"Karan Singh",
"Cyril Zhang",
"Yi Zhang"
] | null | null | Adaptive regularization methods pre-multiply a descent direction by a preconditioning matrix. Due to the large number of parameters of machine learning problems, full-matrix preconditioning methods are prohibitively expensive. We show how to modify full-matrix adaptive regularization in order to make it practical and e... | [] | null | 11 | 1806.02958 | title_snapshot | [
-0.0425356961786747,
-0.04077911376953125,
0.04025338590145111,
0.03193371370434761,
0.03252701088786125,
0.03538951650261879,
0.02952929586172104,
-0.001909688115119934,
-0.04351881891489029,
-0.05929252877831459,
-0.020151372998952866,
0.010660850442945957,
-0.04253213480114937,
-0.01625... |