index int64 0 20.3k | text stringlengths 0 1.3M | year stringdate 1987-01-01 00:00:00 2024-01-01 00:00:00 | No stringlengths 1 4 |
|---|---|---|---|
8,300 | Explanations can be manipulated and geometry is to blame Ann-Kathrin Dombrowski1, Maximilian Alber5, Christopher J. Anders1, Marcel Ackermann2, Klaus-Robert Müller1,3,4, Pan Kessel1 1Machine Learning Group, Technische Universität Berlin, Germany 2Department of Video Coding & Analytics, Fraunhofer Heinrich-Her... | 2019 | 1043 |
8,301 | Input-Cell Attention Reduces Vanishing Saliency of Recurrent Neural Networks Aya Abdelsalam Ismail1, Mohamed Gunady1, Luiz Pessoa2 Héctor Corrada Bravo∗1 , Soheil Feizi ∗1 {asalam,mgunady}@cs.umd.edu, pessoa@umd.edu, hcorrada@umiacs.umd.edu, sfeizi@cs.umd.edu 1 Department of Computer Science, University of ... | 2019 | 1044 |
8,302 | Paradoxes in Fair Machine Learning Paul Gölz, Anson Kahng, and Ariel D. Procaccia Computer Science Department Carnegie Mellon University {pgoelz, akahng, arielpro}@cs.cmu.edu Abstract Equalized odds is a statistical notion of fairness in machine learning that ensures that classification algorithms do not d... | 2019 | 1045 |
8,303 | Learning Conditional Deformable Templates with Convolutional Networks Adrian V. Dalca CSAIL, MIT MGH, HMS adalca@mit.edu Marianne Rakic D-ITET, ETH CSAIL, MIT mrakic@mit.edu John Guttag CSAIL, MIT guttag@mit.edu Mert R. Sabuncu ECE and BME, Cornell msabuncu@cornell.edu Abstract We deve... | 2019 | 1046 |
8,304 | Volumetric Correspondence Networks for Optical Flow Gengshan Yang1∗, Deva Ramanan1,2 1Carnegie Mellon University, 2Argo AI {gengshay, deva}@cs.cmu.edu Abstract Many classic tasks in vision – such as the estimation of optical flow or stereo disparities – can be cast as dense correspondence matching. Wel... | 2019 | 1047 |
8,305 | Variance Reduction in Bipartite Experiments through Correlation Clustering Jean Pouget-Abadie Google Research New York, NY 10011 jeanpa@google.com Kevin Aydin Google Research Mountain View, CA 94043 kaydin@google.com Warren Schudy Google Research New York, NY 10011 wschudy@google.com Kay Bro... | 2019 | 1048 |
8,306 | Attribution-Based Confidence Metric For Deep Neural Networks Susmit Jha Computer Science Laboratory SRI International Sunny Raj, Steven Lawrence Fernandes, Sumit Kumar Jha Computer Science Department University of Central Florida, Orlando Somesh Jha University of Wisconsin-Madison and Xaipient Bria... | 2019 | 1049 |
8,307 | Low-Complexity Nonparametric Bayesian Online Prediction with Universal Guarantees Alix Lhéritier Amadeus SAS F-06902 Sophia-Antipolis, France alix.lheritier@amadeus.com Frédéric Cazals Université Côte d’Azur Inria F-06902 Sophia-Antipolis, France frederic.cazals@inria.fr Abstract We propose a no... | 2019 | 105 |
8,308 | Are Disentangled Representations Helpful for Abstract Visual Reasoning? Sjoerd van Steenkiste IDSIA, USI, SUPSI sjoerd@idsia.ch Francesco Locatello ETH Zurich, MPI-IS locatelf@ethz.ch Jürgen Schmidhuber IDSIA, USI, SUPSI, NNAISENSE juergen@idsia.ch Olivier Bachem Google Research, Brain Team ba... | 2019 | 1050 |
8,309 | RSN: Randomized Subspace Newton Robert M. Gower LTCI, T´el´ecom Paristech, IPP, France gowerrobert@gmail.com Dmitry Kovalev KAUST, Saudi Arabia dmitry.kovalev@kaust.edu.sa Felix Lieder Heinrich-Heine-Universit¨at D¨usseldorf, Germany lieder@opt.uni-duesseldorf.de Peter Richt´arik KAUST, Saudi Arab... | 2019 | 1051 |
8,310 | Beyond Alternating Updates for Matrix Factorization with Inertial Bregman Proximal Gradient Algorithms Mahesh Chandra Mukkamala Mathematical Optimization Group Saarland University, Germany mukkamala@math.uni-sb.de Peter Ochs Mathematical Optimization Group Saarland University, Germany ochs@math.uni-sb... | 2019 | 1052 |
8,311 | Integrating Bayesian and Discriminative Sparse Kernel Machines for Multi-class Active Learning Weishi Shi Rochester Institute of Technology ws7586@rit.edu Qi Yu Rochester Institute of Technology qi.yu@rit.edu Abstract We propose a novel active learning (AL) model that integrates Bayesian and discrim... | 2019 | 1053 |
8,312 | Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networks Yuanzhi Li Machine Learning Department Carnegie Mellon University yuanzhil@andrew.cmu.edu Colin Wei Computer Science Department Stanford University colinwei@stanford.edu Tengyu Ma Computer Sci... | 2019 | 1054 |
8,313 | An Algorithm to Learn Polytree Networks with Hidden Nodes Firoozeh Sepehr Department of EECS University of Tennessee Knoxville 1520 Middle Dr, Knoxville, TN 37996 dawn@utk.edu Donatello Materassi Department of EECS University of Tennessee Knoxville 1520 Middle Dr, Knoxville, TN 37996 dmateras@utk.... | 2019 | 1055 |
8,314 | Provable Gradient Variance Guarantees for Black-Box Variational Inference Justin Domke College of Information and Computer Sciences University of Massachusetts Amherst domke@cs.umass.edu Abstract Recent variational inference methods use stochastic gradient estimators whose variance is not well understoo... | 2019 | 1056 |
8,315 | LiteEval: A Coarse-to-Fine Framework for Resource Efficient Video Recognition Zuxuan Wu1∗, Caiming Xiong2, Yu-Gang Jiang3, Larry S. Davis1 1 University of Maryland, 2 Salesforce Research, 3 Fudan University Abstract This paper presents LiteEval, a simple yet effective coarse-to-fine framework for resource effi... | 2019 | 1057 |
8,316 | Multi-marginal Wasserstein GAN Jiezhang Cao∗, Langyuan Mo∗, Yifan Zhang, Kui Jia, Chunhua Shen, Mingkui Tan∗† South China University of Technology, Peng Cheng Laboratory, The University of Adelaide {secaojiezhang, selymo, sezyifan}@mail.scut.edu.cn {mingkuitan, kuijia}@scut.edu.cn, chunhua.shen@adelaide.edu.au ... | 2019 | 1058 |
8,317 | PyTorch: An Imperative Style, High-Performance Deep Learning Library Adam Paszke University of Warsaw adam.paszke@gmail.com Sam Gross Facebook AI Research sgross@fb.com Francisco Massa Facebook AI Research fmassa@fb.com Adam Lerer Facebook AI Research alerer@fb.com James Bradbury Google ... | 2019 | 1059 |
8,318 | Finding the Needle in the Haystack with Convolutions: on the benefits of architectural bias Stéphane d’Ascoli stephane.dascoli@ens.fr Laboratoire de Physique de l’Ecole normale supérieure ENS, Université PSL, CNRS, Sorbonne Université, Université Paris-Diderot, Sorbonne Paris Cité, Paris, France Levent Sagun... | 2019 | 106 |
8,319 | Learning to Infer Implicit Surfaces without 3D Supervision Shichen Liu†,§, Shunsuke Saito†,§, Weikai Chen (B)†, and Hao Li†,§,‡ †USC Institute for Creative Technologies §University of Southern California ‡Pinscreen {liushichen95, shunsuke.saito16, chenwk891}@gmail.com hao@hao-li.com Abstract Recent ad... | 2019 | 1060 |
8,320 | On Sample Complexity Upper and Lower Bounds for Exact Ranking from Noisy Comparisons Wenbo Ren Department of Computer Science & Engineering The Ohio State University ren.453@osu.edu Jia Liu Department of Computer Science Iowa State University jialiu@iastate.edu Ness B. Shroff Department of Electri... | 2019 | 1061 |
8,321 | Are Labels Required for Improving Adversarial Robustness? Jonathan Uesato⇤ Jean-Baptiste Alayrac⇤ Po-Sen Huang⇤ Robert Stanforth Alhussein Fawzi Pushmeet Kohli DeepMind {juesato,jalayrac,posenhuang}@google.com Abstract Recent work has uncovered the interesting (and somewhat surprising) finding that... | 2019 | 1062 |
8,322 | NAT: Neural Architecture Transformer for Accurate and Compact Architectures Yong Guo∗, Yin Zheng∗, Mingkui Tan∗†, Qi Chen, Jian Chen†, Peilin Zhao, Junzhou Huang South China University of Technology, Weixin Group, Tencent, Tencent AI Lab, University of Texas at Arlington {guo.yong, sechenqi}@mail.scut.edu.c... | 2019 | 1063 |
8,323 | Learning to Self-Train for Semi-Supervised Few-Shot Classification Xinzhe Li1∗ Qianru Sun2† Yaoyao Liu3∗ Shibao Zheng1† Qin Zhou4 Tat-Seng Chua5 Bernt Schiele6 1Shanghai Jiao Tong University 2Singapore Management University 3Tianjin University 4Alibaba Group 5National University of Singapore 6Max Pla... | 2019 | 1064 |
8,324 | Stochastic Frank-Wolfe for Composite Convex Minimization Francesco Locatello? Alp Yurtsever† Olivier Fercoq‡ Volkan Cevher† francesco.locatello@inf.ethz.ch {alp.yurtsever,volkan.cevher}@epfl.ch olivier.fercoq@telecom-paristech.fr ?Department of Computer Science, ETH Zurich, Switzerland †LIONS, Ecole... | 2019 | 1065 |
8,325 | Modeling Dynamic Functional Connectivity with Latent Factor Gaussian Processes Lingge Li∗ UC Irvine linggel@uci.edu Dustin Pluta∗ UC Irvine dpluta@uci.edu Babak Shahbaba UC Irvine babaks@uci.edu Norbert Fortin UC Irvine norbert.fortin@uci.edu Hernando Ombao KAUST hernando.ombao@kaust.edu... | 2019 | 1066 |
8,326 | ETNet: Error Transition Network for Arbitrary Style Transfer Chunjin Song∗ Shenzhen University songchunjin1990@gmail.com Zhijie Wu∗ Shenzhen University wzj.micker@gmail.com Yang Zhou† Shenzhen University zhouyangvcc@gmail.com Minglun Gong University of Guelph minglun@uoguelph.ca Hui Huang† ... | 2019 | 1067 |
8,327 | Cross-lingual Language Model Pretraining Alexis Conneau∗ Facebook AI Research Université Le Mans aconneau@fb.com Guillaume Lample∗ Facebook AI Research Sorbonne Universités glample@fb.com Abstract Recent studies have demonstrated the efficiency of generative pretraining for English natural language u... | 2019 | 1068 |
8,328 | Icebreaker: Element-wise Efficient Information Acquisition with a Bayesian Deep Latent Gaussian Model Wenbo Gong1∗, Sebastian Tschiatschek2, Richard E. Turner12, Sebastian Nowozin2†, José Miguel Hernández-Lobato12, Cheng Zhang2 Abstract In this paper, we address the ice-start problem, i.e., the challenge of ... | 2019 | 1069 |
8,329 | Efficiently avoiding saddle points with zero order methods: No gradients required Lampros Flokas∗ Department of Computer Science Columbia University New York, NY 10025 lamflokas@cs.columbia.edu Emmanouil V. Vlatakis-Gkaragkounis∗ Department of Computer Science Columbia University New York, NY 10025 ... | 2019 | 107 |
8,330 | Efficient and Thrifty Voting by Any Means Necessary Debmalya Mandal Columbia University dm3557@columbia.edu Ariel D. Procaccia Carnegie Mellon University arielpro@cs.cmu.edu Nisarg Shah University of Toronto nisarg@cs.toronto.edu David P. Woodruff Carnegie Mellon University dwoodruf@cs.cmu.edu ... | 2019 | 1070 |
8,331 | Post training 4-bit quantization of convolutional networks for rapid-deployment Ron Banner1 , Yury Nahshan1 , and Daniel Soudry2 Intel – Artificial Intelligence Products Group (AIPG)1 Technion – Israel Institute of Technology2 {ron.banner, yury.nahshan}@intel.com daniel.soudry@gmail.com Abstract Convolut... | 2019 | 1071 |
8,332 | Implicit Regularization in Deep Matrix Factorization Sanjeev Arora Princeton University and Institute for Advanced Study arora@cs.princeton.edu Nadav Cohen Tel Aviv University cohennadav@cs.tau.ac.il Wei Hu Princeton University huwei@cs.princeton.edu Yuping Luo Princeton University yupingl@cs.pr... | 2019 | 1072 |
8,333 | Crowdsourcing via Pairwise Co-occurrences: Identifiability and Algorithms Shahana Ibrahim School of Elect. Eng. & Computer Sci. Oregon State University Corvallis, OR 97331 ibrahish@oregonstate.edu Xiao Fu∗ School of Elect. Eng. & Computer Sci. Oregon State University Corvallis, OR 97331 xiao.fu@ore... | 2019 | 1073 |
8,334 | Learning low-dimensional state embeddings and metastable clusters from time series data Yifan Sun Carnegie Mellon University yifans@andrew.cmu.edu Yaqi Duan Princeton University yaqid@princeton.edu Hao Gong Princeton University hgong@princeton.edu Mengdi Wang Princeton University mengdiw@princ... | 2019 | 1074 |
8,335 | Necessary and Sufficient Geometries for Gradient Methods Daniel Levy Stanford University danilevy@stanford.edu John C. Duchi Stanford University jduchi@stanford.edu Abstract We study the impact of the constraint set and gradient geometry on the convergence of online and stochastic methods for convex ... | 2019 | 1075 |
8,336 | Limitations of Lazy Training of Two-layers Neural Networks Behrooz Ghorbani Department of Electrical Engineering Stanford University ghorbani@stanford.edu Song Mei ICME Stanford University songmei@stanford.edu Theodor Misiakiewicz Department of Statistics Stanford University misiakie@stanford.... | 2019 | 1076 |
8,337 | Learning Auctions with Robust Incentive Guarantees Jacob Abernethy Georgia Tech prof@gatech.edu Rachel Cummings Georgia Tech rachelc@gatech.edu Bhuvesh Kumar Georgia Tech bhuvesh@gatech.edu Jamie Morgenstern Georgia Tech jamiemmt.cs@gatech.edu Samuel Taggart Oberlin College sam.taggart@obe... | 2019 | 1077 |
8,338 | Local SGD with Periodic Averaging: Tighter Analysis and Adaptive Synchronization Farzin Haddadpour Penn State fxh18@psu.edu Mohammad Mahdi Kamani Penn State mqk5591@psu.edu Mehrdad Mahdavi Penn State mzm616@psu.edu Viveck R. Cadambe Penn State vxc12@psu.edu Abstract Communication overhead ... | 2019 | 1078 |
8,339 | Scalable Bayesian inference of dendritic voltage via spatiotemporal recurrent state space models Ruoxi Sun∗ Columbia University Scott W. Linderman∗ Stanford University Ian August Kinsella Columbia University Liam Paninski Columbia University Abstract Recent advances in optical voltage sensors have... | 2019 | 1079 |
8,340 | Learning metrics for persistence-based summaries and applications for graph classification Qi Zhao Yusu Wang zhao.2017@osu.edu yusu@cse.ohio-state.edu Computer Science and Engineering Department The Ohio State University Columbus, OH 43221 Abstract Recently a new feature representation framework base... | 2019 | 108 |
8,341 | Constrained Reinforcement Learning Has Zero Duality Gap Santiago Paternain, Luiz F. O. Chamon, Miguel Calvo-Fullana and Alejandro Ribeiro Electrical and Systems Engineering University of Pennsylvania {spater,luizf,cfullana,aribeiro}@seas.upenn.edu Abstract Autonomous agents must often deal with conflicting... | 2019 | 1080 |
8,342 | A Meta-MDP Approach to Exploration for Lifelong Reinforcement Learning Francisco M. Garcia and Philip S. Thomas College of Information and Computer Sciences University of Massachusetts Amherst Amherst, MA, USA {fmgarcia,pthomas}@cs.umass.edu Abstract In this paper we consider the problem of how a reinfo... | 2019 | 1081 |
8,343 | Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reduction Aviral Kumar∗ UC Berkeley aviralk@berkeley.edu Justin Fu∗ UC Berkeley justinjfu@eecs.berkeley.edu George Tucker Google Brain gjt@google.com Sergey Levine UC Berkeley, Google Brain svlevine@eecs.berkeley.edu Abstract Off-po... | 2019 | 1082 |
8,344 | Learning by Abstraction: The Neural State Machine Drew A. Hudson Stanford University 353 Serra Mall, Stanford, CA 94305 dorarad@cs.stanford.edu Christopher D. Manning Stanford University 353 Serra Mall, Stanford, CA 94305 manning@cs.stanford.edu Abstract We introduce the Neural State Machine, seekin... | 2019 | 1083 |
8,345 | Unified Language Model Pre-training for Natural Language Understanding and Generation Li Dong∗ Nan Yang∗ Wenhui Wang∗ Furu Wei∗† Xiaodong Liu Yu Wang Jianfeng Gao Ming Zhou Hsiao-Wuen Hon Microsoft Research {lidong1,nanya,wenwan,fuwei}@microsoft.com {xiaodl,yuwan,jfgao,mingzhou,hon}@microsoft.c... | 2019 | 1084 |
8,346 | Adaptive GNN for Image Analysis and Editing Lingyu Liang South China Univ. of Tech. lianglysky@gmail.com Lianwen Jin∗ South China Univ. of Tech. lianwen.jin@gmail.com Yong Xu∗ South China Univ. of Tech. Peng Cheng Laboratory yxu@scut.edu.cn Abstract Graph neural network (GNN) has powerful repres... | 2019 | 1085 |
8,347 | Metric Learning for Adversarial Robustness Chengzhi Mao Columbia University cm3797@columbia.edu Ziyuan Zhong Columbia University ziyuan.zhong@columbia.edu Junfeng Yang Columbia University junfeng@cs.columbia.edu Carl Vondrick Columbia University vondrick@cs.columbia.edu Baishakhi Ray Columbi... | 2019 | 1086 |
8,348 | Fine-grained Optimization of Deep Neural Networks Mete Ozay∗ Abstract In recent studies, several asymptotic upper bounds on generalization errors on deep neural networks (DNNs) are theoretically derived. These bounds are functions of several norms of weights of the DNNs, such as the Frobenius and spectral nor... | 2019 | 1087 |
8,349 | Learning to Control Self-Assembling Morphologies: A Study of Generalization via Modularity Deepak Pathak∗ UC Berkeley Chris Lu∗ UC Berkeley Trevor Darrell UC Berkeley Phillip Isola MIT Alexei A. Efros UC Berkeley Abstract Contemporary sensorimotor learning approaches typically start with an ex... | 2019 | 1088 |
8,350 | An Adaptive Mirror-Prox Algorithm for Variational Inequalities with Singular Operators Kimon Antonakopoulos Univ. Grenoble Alpes, CNRS, Inria, Grenoble INP LIG 38000 Grenoble, France. kimon.antonakopoulos@inria.fr E. Veronica Belmega ETIS/ENSEA Univ. de Cergy-Pontoise-CNRS, France belmega@ensea.fr P... | 2019 | 1089 |
8,351 | PasteGAN: A Semi-Parametric Method to Generate Image from Scene Graph Yikang Li1∗, Tao Ma2∗, Yeqi Bai3, Nan Duan4, Sining Wei4, Xiaogang Wang1 1The Chinese University of Hong Kong, 2Northwestern Polytechnical University 3Nanyang Technological University, 4Microsoft {ykli, xgwang}@ee.cuhk.edu.hk, taoma@mail.nw... | 2019 | 109 |
8,352 | Alleviating Label Switching with Optimal Transport Pierre Monteiller ENS Ulm pierre.monteiller@ens.fr Sebastian Claici MIT CSAIL & MIT-IBM Watson AI Lab sclaici@mit.edu Edward Chien MIT CSAIL & MIT-IBM Watson AI Lab edchien@mit.edu Farzaneh Mirzazadeh IBM Research & MIT-IBM Watson AI Lab farzane... | 2019 | 1090 |
8,353 | Fisher Efficient Inference of Intractable Models Song Liu University of Bristol The Alan Turing Institute, UK song.liu@bristol.ac.uk Takafumi Kanamori Tokyo Institute of Technology, RIKEN, Japan kanamori@c.titech.ac.jp Wittawat Jitkrittum Max Planck Institute for Intelligent Systems, Germany witt... | 2019 | 1091 |
8,354 | Stochastic Gradient Hamiltonian Monte Carlo Methods with Recursive Variance Reduction Difan Zou Department of Computer Science University of California, Los Angeles Los Angeles, CA 90095 knowzou@cs.ucla.edu Pan Xu Department of Computer Science University of California, Los Angeles Los Angeles, CA 9... | 2019 | 1092 |
8,355 | Online Learning via the Differential Privacy Lens Jacob Abernethy∗ College of Computing Georgia Institute of Technology prof@gatech.edu Young Hun Jung∗ Department of Statistics University of Michigan yhjung@umich.edu Chansoo Lee∗ Google Brain chansoo@google.com Audra McMillan∗ Simons Inst. for... | 2019 | 1093 |
8,356 | Characterization and Learning of Causal Graphs with Latent Variables from Soft Interventions Murat Kocaoglu∗ MIT-IBM Watson AI Lab IBM Research MA, USA murat@ibm.com Amin Jaber∗ Department of Computer Science Purdue University, USA jaber0@purdue.edu Karthikeyan Shanmugam∗ MIT-IBM Watson AI Lab I... | 2019 | 1094 |
8,357 | Domes to Drones: Self-Supervised Active Triangulation for 3D Human Pose Reconstruction Aleksis Pirinen,1∗Erik Gärtner1∗and Cristian Sminchisescu1,2 1Department of Mathematics, Faculty of Engineering, Lund University 2Google Research {aleksis.pirinen, erik.gartner, cristian.sminchisescu}@math.lth.se Abstract... | 2019 | 1095 |
8,358 | SIC - MMAB: Synchronisation Involves Communication in Multiplayer Multi-Armed Bandits Etienne Boursier CMLA, ENS Paris-Saclay etienne.boursier@ens-paris-saclay.fr Vianney Perchet CMLA, ENS Paris-Saclay Criteo AI Lab, Paris vianney.perchet@normalesup.org Abstract Motivated by cognitive radio networks... | 2019 | 1096 |
8,359 | A Step Toward Quantifying Independently Reproducible Machine Learning Research Edward Raff Booz Allen Hamilton raff_edward@bah.com University of Maryland, Baltimore County raff.edward@umbc.edu Abstract What makes a paper independently reproducible? Debates on reproducibility center around intuition or a... | 2019 | 1097 |
8,360 | Latent Distance Estimation for Random Geometric Graphs Ernesto Araya Laboratoire de Mathématiques d’Orsay (LMO) Université Paris-Sud 91405 Orsay Cedex, France ernesto.araya-valdivia@u-psud.fr Yohann De Castro Institut Camille Jordan École Centrale de Lyon 69134 Écully, France yohann.de-castro@ec-l... | 2019 | 1098 |
8,361 | Dual Adversarial Semantics-Consistent Network for Generalized Zero-Shot Learning Jian Ni1 nj1@mail.ustc.edu.cn Shanghang Zhang2 shanghaz@andrew.cmu.edu Haiyong Xie3,4,1 haiyong.xie@ieee.org 1University of Science and Technology of China, Anhui 230026, China 1 2Carnegie Mellon University, Pittsburgh,... | 2019 | 1099 |
8,362 | Think out of the “Box”: Generically-Constrained Asynchronous Composite Optimization and Hedging Pooria Joulani⇤ DeepMind, UK pjoulani@google.com András György DeepMind, UK agyorgy@google.com Csaba Szepesvári DeepMind, UK szepi@google.com Abstract We present two new algorithms, ASYNCADA and HEDGE... | 2019 | 11 |
8,363 | Learning Local Search Heuristics for Boolean Satisfiability Emre Yolcu Carnegie Mellon University eyolcu@cs.cmu.edu Barnabás Póczos Carnegie Mellon University bapoczos@cs.cmu.edu Abstract We present an approach to learn SAT solver heuristics from scratch through deep reinforcement learning with a cur... | 2019 | 110 |
8,364 | Manipulating a Learning Defender and Ways to Counteract Jiarui Gan University of Oxford Oxford, UK jiarui.gan@cs.ox.ac.uk Qingyu Guo Nanyang Technological University Singapore qguo005@e.ntu.edu.sg Long Tran-Thanh University of Southampton Southampton, UK l.tran-thanh@soton.ac.uk Bo An Nany... | 2019 | 1100 |
8,365 | Privacy Amplification by Mixing and Diffusion Mechanisms Borja Balle Gilles Barthe MPI for Security and Privacy IMDEA Software Institute Marco Gaboardi Boston University Joseph Geumlek University of California, San Diego Abstract A fundamental result in differential privacy states that the privacy ... | 2019 | 1101 |
8,366 | Ultra Fast Medoid Identification via Correlated Sequential Halving Tavor Z. Baharav Department of Electrical Engineering Stanford University Stanford, CA 94305 tavorb@stanford.edu David Tse Department of Electrical Engineering Stanford University Stanford, CA 94305 dntse@stanford.edu Abstract T... | 2019 | 1102 |
8,367 | On the Inductive Bias of Neural Tangent Kernels Alberto Bietti Inria∗ alberto.bietti@inria.fr Julien Mairal Inria∗ julien.mairal@inria.fr Abstract State-of-the-art neural networks are heavily over-parameterized, making the optimization algorithm a crucial ingredient for learning predictive models with g... | 2019 | 1103 |
8,368 | Surround Modulation: A Bio-inspired Connectivity Structure for Convolutional Neural Networks Hosein Hasani Department of Electrical Engineering Sharif University of Technology hasani.hosein@ee.sharif.edu Mahdieh Soleymani Baghshah Department of Computer Engineering Sharif University of Technology sole... | 2019 | 1104 |
8,369 | Rethinking Kernel Methods for Node Representation Learning on Graphs Yu Tian∗ Rutgers University yt219@cs.rutgers.edu Long Zhao∗ Rutgers University lz311@cs.rutgers.edu Xi Peng University of Delaware xipeng@udel.edu Dimitris N. Metaxas Rutgers University dnm@cs.rutgers.edu Abstract Graph k... | 2019 | 1105 |
8,370 | A necessary and sufficient stability notion for adaptive generalization Katrina Ligett School of Computer Science & Engineering Hebrew University of Jerusalem Jerusalem 91904, Israel katrina@cs.huji.ac.il Moshe Shenfeld School of Computer Science & Engineering Hebrew University of Jerusalem Jerusalem... | 2019 | 1106 |
8,371 | Implicit Regularization of Accelerated Methods in Hilbert Spaces Nicolò Pagliana University of Genoa DIMA & MaLGa pagliana@dima.unige.it Lorenzo Rosasco University of Genoa DIBRIS, MaLGa, IIT & MIT lrosasco@mit.edu Abstract We study learning properties of accelerated gradient descent methods for l... | 2019 | 1107 |
8,372 | Input Similarity from the Neural Network Perspective Guillaume Charpiat1 Nicolas Girard2 Loris Felardos1 Yuliya Tarabalka2,3 1 TAU team, INRIA Saclay, LRI, Univ. Paris-Sud 2 TITANE team, INRIA Sophia-Antipolis, Univ. Côte d’Azur 3 LuxCarta Technology firstname.lastname@inria.fr Abstract Given a trai... | 2019 | 1108 |
8,373 | Transfer Learning via Minimizing the Performance Gap Between Domains Boyu Wang Department of Computer Science University of Western Ontario bwang@csd.uwo.ca Jorge A. Mendez Department of Computer and Information Science University of Pennsylvania mendezme@seas.upenn.edu Ming Bo Cai Princeton Neuro... | 2019 | 1109 |
8,374 | Learning to Perform Local Rewriting for Combinatorial Optimization Xinyun Chen ∗ UC Berkeley xinyun.chen@berkeley.edu Yuandong Tian Facebook AI Research yuandong@fb.com Abstract Search-based methods for hard combinatorial optimization are often guided by heuristics. Tuning heuristics in various cond... | 2019 | 111 |
8,375 | Catastrophic Forgetting Meets Negative Transfer: Batch Spectral Shrinkage for Safe Transfer Learning Xinyang Chen∗, Sinan Wang∗, Bo Fu, Mingsheng Long (B)†, and Jianmin Wang School of Software, BNRist, Tsinghua University, China Research Center for Big Data, Tsinghua University, China National Engineering Lab... | 2019 | 1110 |
8,376 | ViLBERT: Pretraining Task-Agnostic Visiolinguistic Representations for Vision-and-Language Tasks Jiasen Lu1, Dhruv Batra1,3, Devi Parikh1,3, Stefan Lee1,2 1Georgia Institute of Technology, 2Oregon State University, 3Facebook AI Research Abstract We present ViLBERT (short for Vision-and-Language BERT), a model... | 2019 | 1111 |
8,377 | Efficiently Learning Fourier Sparse Set Functions Andisheh Amrollahi ∗ ETH Zurich Zurich, Switzerland amrollaa@ethz.ch Amir Zandieh ∗ EPFL Lausanne, Switzerland amir.zandieh@epfl.ch Michael Kapralov† EPFL Lausanne, Switzerland michael.kapralov@epfl.ch Andreas Krause ETH Zurich Zurich, Switz... | 2019 | 1112 |
8,378 | Search-Guided, Lightly-Supervised Training of Structured Prediction Energy Networks Amirmohammad Rooshenas, Dongxu Zhang, Gopal Sharma, and Andrew McCallum College of Information of Computer Sciences University of Massachusetts Amherst Amherst, MA 01003 {pedram,dongxuzhang,gopalsharma,mccallum}@cs.umass.edu... | 2019 | 1113 |
8,379 | Planning with Goal-Conditioned Policies Soroush Nasiriany∗, Vitchyr H. Pong∗, Steven Lin, Sergey Levine University of California, Berkeley {snasiriany,vitchyr,stevenlin598,svlevine@berkeley.edu} Abstract Planning methods can solve temporally extended sequential decision making problems by composing simple beh... | 2019 | 1114 |
8,380 | Goal-conditioned Imitation Learning Yiming Ding∗ Department of Computer Science University of California, Berkeley dingyiming0427@berkeley.edu Carlos Florensa∗ Department of Computer Science University of California, Berkeley florensa@berkeley.edu Mariano Phielipp Intel AI Labs mariano.j.phielipp@... | 2019 | 1115 |
8,381 | Superset Technique for Approximate Recovery in One-Bit Compressed Sensing Larkin Flodin University of Massachusetts Amherst Amherst, MA 01003 lflodin@cs.umass.edu Venkata Gandikota University of Massachusetts Amherst Amherst, MA 01003 gandikota.venkata@gmail.com Arya Mazumdar University of Massach... | 2019 | 1116 |
8,382 | Iterative Least Trimmed Squares for Mixed Linear Regression Yanyao Shen ECE Department University of Texas at Austin Austin, TX 78712 shenyanyao@utexas.edu Sujay Sanghavi ECE Department University of Texas at Austin Austin, TX 78712 sanghavi@mail.utexas.edu Abstract Given a linear regression s... | 2019 | 1117 |
8,383 | Asymptotic Guarantees for Learning Generative Models with the Sliced-Wasserstein Distance Kimia Nadjahi1, Alain Durmus2, Umut ¸Sim¸sekli1,3, Roland Badeau1 1: LTCI, Télécom Paris, Institut Polytechnique de Paris, France 2: CMLA, ENS Cachan, CNRS, Université Paris-Saclay, France 3: Department of Statistics, Un... | 2019 | 1118 |
8,384 | Time-series Generative Adversarial Networks Jinsung Yoon∗ University of California, Los Angeles, USA jsyoon0823@g.ucla.edu Daniel Jarrett∗ University of Cambridge, UK daniel.jarrett@maths.cam.ac.uk Mihaela van der Schaar University of Cambridge, UK University of California, Los Angeles, USA Alan Tur... | 2019 | 1119 |
8,385 | A Unified Bellman Optimality Principle Combining Reward Maximization and Empowerment Felix Leibfried, Sergio Pascual-Díaz, Jordi Grau-Moya PROWLER.io Cambridge, UK {felix,sergio.diaz,jordi}@prowler.io Abstract Empowerment is an information-theoretic method that can be used to intrinsically motivate learn... | 2019 | 112 |
8,386 | Dynamics of stochastic gradient descent for two-layer neural networks in the teacher-student setup Sebastian Goldt1, Madhu S. Advani2, Andrew M. Saxe3 Florent Krzakala4, Lenka Zdeborová1 1 Institut de Physique Théorique, CNRS, CEA, Université Paris-Saclay, Saclay, France 2 Center for Brain Science, Harvard Un... | 2019 | 1120 |
8,387 | Learning Nonsymmetric Determinantal Point Processes Mike Gartrell Criteo AI Lab m.gartrell@criteo.com Victor-Emmanuel Brunel ENSAE ParisTech victor.emmanuel.brunel@ensae.fr Elvis Dohmatob Criteo AI Lab e.dohmatob@criteo.com Syrine Krichene ⇤ Criteo AI Lab syrinekrichene@google.com Abstract ... | 2019 | 1121 |
8,388 | Quantum Embedding of Knowledge for Reasoning Dinesh Garg1∗, Shajith Ikbal1∗, Santosh K. Srivastava1, Harit Vishwakarma2†, Hima Karanam1, L Venkata Subramaniam1 1IBM Research AI, India 2Dept. of Computer Sciences, University of Wisconsin-Madison, USA garg.dinesh, shajmoha, sasriva5@in.ibm.com, hvishwakarma@cs.... | 2019 | 1122 |
8,389 | Online Normalization for Training Neural Networks Vitaliy Chiley∗ Ilya Sharapov∗ Atli Kosson Urs Koster Ryan Reece Sofía Samaniego de la Fuente Vishal Subbiah Michael James∗† Cerebras Systems 175 S. San Antonio Road Los Altos, California 94022 Abstract Online Normalization is a new technique f... | 2019 | 1123 |
8,390 | Equitable Stable Matchings in Quadratic Time Nikolaos Tziavelis Northeastern University Ioannis Giannakopoulos NTU Athens Katerina Doka NTU Athens Nectarios Koziris NTU Athens Panagiotis Karras Aarhus University Abstract Can we reach a stable matching that achieves high equity among the two side... | 2019 | 1124 |
8,391 | Making AI Forget You: Data Deletion in Machine Learning Antonio A. Ginart1, Melody Y. Guan2, Gregory Valiant2, and James Zou3 1Dept. of Electrical Engineering 2Dept. of Computer Science 3Dept. of Biomedial Data Science Stanford University, Palo Alto, CA 94305 {tginart, mguan, valiant, jamesz}@stanford.edu... | 2019 | 1125 |
8,392 | A New Defense Against Adversarial Images: Turning a Weakness into a Strength Tao Yu∗† Shengyuan Hu∗† Chuan Guo† Wei-Lun Chao‡ Kilian Q. Weinberger† Abstract Natural images are virtually surrounded by low-density misclassified regions that can be efficiently discovered by gradient-guided search — enablin... | 2019 | 1126 |
8,393 | Hamiltonian descent for composite objectives Brendan O’Donoghue DeepMind ❜♦❞♦♥♦❣❤✉❡❅❣♦♦❣❧❡✳❝♦♠ Chris J. Maddison DeepMind / University of Oxford ❝♠❛❞❞✐s❅❣♦♦❣❧❡✳❝♦♠ Abstract In optimization the duality gap between the primal and the dual problems is a measure of the suboptimality of any primal-dual poi... | 2019 | 1127 |
8,394 | Game Design for Eliciting Distinguishable Behavior Fan Yang1∗, Liu Leqi1∗, Yifan Wu1∗, Zachary C. Lipton1†, Pradeep Ravikumar1∗, William W. Cohen1,2∗, Tom Mitchell1† 1Carnegie Mellon University 2 Google Inc. ∗{fanyang1,leqil,yw4,pradeepr,wcohen}@cs.cmu.edu †{zlipton, tom.mitchell}@cmu.edu Abstract The a... | 2019 | 1128 |
8,395 | Divergence-Augmented Policy Optimization Qing Wang ∗ Huya AI Guangzhou, China Yingru Li The Chinese University of Hong Kong Shenzhen, China Jiechao Xiong Tencent AI Lab Shenzhen, China Tong Zhang The Hong Kong University of Science and Technology Hong Kong, China Abstract In deep reinforceme... | 2019 | 1129 |
8,396 | Learning Representations for Time Series Clustering Qianli Ma South China University of Technology Guangzhou, China qianlima@scut.edu.cn Jiawei Zheng∗ South China University of Technology Guangzhou, China csjwzheng@foxmail.com Sen Li ∗ South China University of Technology Guangzhou, China awslee... | 2019 | 113 |
8,397 | Gaussian-Based Pooling for Convolutional Neural Networks Takumi Kobayashi National Institute of Advanced Industrial Science and Technology (AIST) 1-1-1 Umezono, Tsukuba, Japan takumi.kobayashi@aist.go.jp Abstract Convolutional neural networks (CNNs) contain local pooling to effectively downsize feature ma... | 2019 | 1130 |
8,398 | Band-Limited Gaussian Processes: The Sinc Kernel Felipe Tobar Center for Mathematical Modeling Universidad de Chile ftobar@dim.uchile.cl Abstract We propose a novel class of Gaussian processes (GPs) whose spectra have compact support, meaning that their sample trajectories are almost-surely band limited... | 2019 | 1131 |
8,399 | Break the Ceiling: Stronger Multi-scale Deep Graph Convolutional Networks Sitao Luan1,2,⇤, Mingde Zhao1,2,⇤, Xiao-Wen Chang1, Doina Precup1,2,3 {sitao.luan@mail, mingde.zhao@mail, chang@cs, dprecup@cs}.mcgill.ca 1McGill University; 2Mila; 3DeepMind ⇤Equal Contribution Abstract Recently, neural network bas... | 2019 | 1132 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.