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 |
|---|---|---|---|
7,200 | The Expxorcist: Nonparametric Graphical Models Via Conditional Exponential Densities Arun Sai Suggala ∗ Carnegie Mellon University Pittsburgh, PA 15213 Mladen Kolar † University of Chicago Chicago, IL 60637 Pradeep Ravikumar ‡ Carnegie Mellon University Pittsburgh, PA 15213 Abstract Non-parametr... | 2017 | 674 |
7,201 | Generating steganographic images via adversarial training Jamie Hayes University College London j.hayes@cs.ucl.ac.uk George Danezis University College London The Alan Turing Institute g.danezis@ucl.ac.uk Abstract Adversarial training has proved to be competitive against supervised learning methods... | 2017 | 675 |
7,202 | NeuralFDR: Learning Discovery Thresholds from Hypothesis Features Fei Xia⇤, Martin J. Zhang⇤, James Zou†, David Tse† Stanford University {feixia,jinye,jamesz,dntse}@stanford.edu Abstract As datasets grow richer, an important challenge is to leverage the full features in the data to maximize the numb... | 2017 | 676 |
7,203 | A Scale Free Algorithm for Stochastic Bandits with Bounded Kurtosis Tor Lattimore∗ tor.lattimore@gmail.com Abstract Existing strategies for finite-armed stochastic bandits mostly depend on a parameter of scale that must be known in advance. Sometimes this is in the form of a bound on the payoffs, or the know... | 2017 | 677 |
7,204 | Value Prediction Network Junhyuk Oh† Satinder Singh† Honglak Lee∗,† †University of Michigan ∗Google Brain {junhyuk,baveja,honglak}@umich.edu, honglak@google.com Abstract This paper proposes a novel deep reinforcement learning (RL) architecture, called Value Prediction Network (VPN), which integrates m... | 2017 | 678 |
7,205 | Detrended Partial Cross Correlation for Brain Connectivity Analysis Jaime S Ide∗ Yale University New Haven, CT 06519 jaime.ide@yale.edu Fabio A Cappabianco Federal University of Sao Paulo S.J. dos Campos, 12231, Brazil cappabianco@unifesp.br Fabio A Faria Federal University of Sao Paulo S.J. dos... | 2017 | 679 |
7,206 | Collaborative PAC Learning Avrim Blum Toyota Technological Institute at Chicago Chicago, IL 60637 avrim@ttic.edu Nika Haghtalab Computer Science Department Carnegie Mellon University Pittsburgh, PA 15213 nhaghtal@cs.cmu.edu Ariel D. Procaccia Computer Science Department Carnegie Mellon Universit... | 2017 | 68 |
7,207 | Polynomial time algorithms for dual volume sampling Chengtao Li MIT ctli@mit.edu Stefanie Jegelka MIT stefje@csail.mit.edu Suvrit Sra MIT suvrit@mit.edu Abstract We study dual volume sampling, a method for selecting k columns from an n ⇥m short and wide matrix (n k m) such that the probability... | 2017 | 69 |
7,208 | 2017 | 7 | |
7,209 | Premise Selection for Theorem Proving by Deep Graph Embedding Mingzhe Wang∗ Yihe Tang∗ Jian Wang Jia Deng University of Michigan, Ann Arbor Abstract We propose a deep learning-based approach to the problem of premise selection: selecting mathematical statements relevant for proving a given conjecture.... | 2017 | 70 |
7,210 | Differentiable Learning of Submodular Models Josip Djolonga Department of Computer Science ETH Zurich josipd@inf.ethz.ch Andreas Krause Department of Computer Science ETH Zurich krausea@ethz.ch Abstract Can we incorporate discrete optimization algorithms within modern machine learning models? For ex... | 2017 | 71 |
7,211 | YASS: Yet Another Spike Sorter JinHyung Lee1, David Carlson2, Hooshmand Shokri1, Weichi Yao1, Georges Goetz3, Espen Hagen4, Eleanor Batty1, EJ Chichilnisky3, Gaute Einevoll5, and Liam Paninski1 1Columbia University, 2Duke University, 3Stanford University, 4University of Oslo, 5Norwegian University of Life Scien... | 2017 | 72 |
7,212 | Variational Laws of Visual Attention for Dynamic Scenes Dario Zanca DINFO, University of Florence DIISM, University of Siena dario.zanca@unifi.it Marco Gori DIISM, University of Siena marco@diism.unisi.it Abstract Computational models of visual attention are at the crossroad of disciplines like co... | 2017 | 73 |
7,213 | How regularization affects the critical points in linear networks Amirhossein Taghvaei∗ Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, IL, 61801 taghvae2@illinois.edu Jin W. Kim Coordinated Science Laboratory University of Illinois at Urbana-Champaign Urbana, IL, 6... | 2017 | 74 |
7,214 | On Tensor Train Rank Minimization: Statistical Efficiency and Scalable Algorithm Masaaki Imaizumi Institute of Statistical Mathematics RIKEN Center for Advanced Intelligence Project imaizumi@ism.ac.jp Takanori Maehara RIKEN Center for Advanced Intelligence Project takanori.maehara@riken.jp Kohei Hayash... | 2017 | 75 |
7,215 | EX2: Exploration with Exemplar Models for Deep Reinforcement Learning Justin Fu∗ John D. Co-Reyes∗ Sergey Levine University of California Berkeley {justinfu,jcoreyes,svlevine}@eecs.berkeley.edu Abstract Deep reinforcement learning algorithms have been shown to learn complex tasks using highly general ... | 2017 | 76 |
7,216 | Training Quantized Nets: A Deeper Understanding Hao Li1∗, Soham De1∗, Zheng Xu1, Christoph Studer2, Hanan Samet1, Tom Goldstein1 1Department of Computer Science, University of Maryland, College Park 2School of Electrical and Computer Engineering, Cornell University {haoli,sohamde,xuzh,hjs,tomg}@cs.umd.edu, stud... | 2017 | 77 |
7,217 | Convolutional Gaussian Processes Mark van der Wilk Department of Engineering University of Cambridge, UK mv310@cam.ac.uk Carl Edward Rasmussen Department of Engineering University of Cambridge, UK cer54@cam.ac.uk James Hensman prowler.io Cambridge, UK james@prowler.io Abstract We present a p... | 2017 | 78 |
7,218 | Best Response Regression Omer Ben-Porat Technion - Israel Institute of Technology Haifa 32000 Israel omerbp@campus.technion.ac.il Moshe Tennenholtz Technion - Israel Institute of Technology Haifa 32000 Israel moshet@ie.technion.ac.il Abstract In a regression task, a predictor is given a set of insta... | 2017 | 79 |
7,219 | Beyond Worst-case: A Probabilistic Analysis of Affine Policies in Dynamic Optimization Omar El Housni IEOR Department Columbia University oe2148@columbia.edu Vineet Goyal IEOR Department Columbia University vg2277@columbia.edu Abstract Affine policies (or control) are widely used as a solution appro... | 2017 | 8 |
7,220 | Elementary Symmetric Polynomials for Optimal Experimental Design Zelda Mariet Massachusetts Institute of Technology Cambridge, MA 02139 zelda@csail.mit.edu Suvrit Sra Massachusetts Institute of Technology Cambridge, MA 02139 suvrit@mit.edu Abstract We revisit the classical problem of optimal exper... | 2017 | 80 |
7,221 | Learning from Complementary Labels Takashi Ishida1,2,3 Gang Niu2,3 Weihua Hu2,3 Masashi Sugiyama3,2 1 Sumitomo Mitsui Asset Management, Tokyo, Japan 2 The University of Tokyo, Tokyo, Japan 3 RIKEN, Tokyo, Japan {ishida@ms., gang@ms., hu@ms., sugi@}k.u-tokyo.ac.jp Abstract Collecting labeled data is ... | 2017 | 81 |
7,222 | Dynamic Importance Sampling for Anytime Bounds of the Partition Function Qi Lou Computer Science Univ. of California, Irvine Irvine, CA 92697, USA qlou@ics.uci.edu Rina Dechter Computer Science Univ. of California, Irvine Irvine, CA 92697, USA dechter@ics.uci.edu Alexander Ihler Computer Scien... | 2017 | 82 |
7,223 | Process-constrained batch Bayesian Optimisation Pratibha Vellanki1, Santu Rana1, Sunil Gupta1, David Rubin2 Alessandra Sutti2, Thomas Dorin2, Murray Height2,Paul Sandars3, Svetha Venkatesh1 1Centre for Pattern Recognition and Data Analytics Deakin University, Geelong, Australia [pratibha.vellanki, santu.rana,... | 2017 | 83 |
7,224 | Uprooting and Rerooting Higher-Order Graphical Models Mark Rowland∗ University of Cambridge mr504@cam.ac.uk Adrian Weller∗ University of Cambridge and Alan Turing Institute aw665@cam.ac.uk Abstract The idea of uprooting and rerooting graphical models was introduced specifically for binary pairwise mo... | 2017 | 84 |
7,225 | Learned in Translation: Contextualized Word Vectors Bryan McCann bmccann@salesforce.com James Bradbury james.bradbury@salesforce.com Caiming Xiong cxiong@salesforce.com Richard Socher rsocher@salesforce.com Abstract Computer vision has benefited from initializing multiple deep layers with weights p... | 2017 | 85 |
7,226 | Semisupervised Clustering, AND-Queries and Locally Encodable Source Coding Arya Mazumdar College of Information & Computer Sciences University of Massachusetts Amherst Amherst, MA 01003 arya@cs.umass.edu Soumyabrata Pal College of Information & Computer Sciences University of Massachusetts Amherst A... | 2017 | 86 |
7,227 | Regularizing Deep Neural Networks by Noise: Its Interpretation and Optimization Hyeonwoo Noh Tackgeun You Jonghwan Mun Bohyung Han Dept. of Computer Science and Engineering, POSTECH, Korea {shgusdngogo,tackgeun.you,choco1916,bhhan}@postech.ac.kr Abstract Overfitting is one of the most critical challeng... | 2017 | 87 |
7,228 | Few-Shot Adversarial Domain Adaptation Saeid Motiian, Quinn Jones, Seyed Mehdi Iranmanesh, Gianfranco Doretto Lane Department of Computer Science and Electrical Engineering West Virginia University {samotiian, qjones1, seiranmanesh, gidoretto}@mix.wvu.edu Abstract This work provides a framework for addressi... | 2017 | 88 |
7,229 | Robust and Efficient Transfer Learning with Hidden Parameter Markov Decision Processes Taylor Killian∗ taylorkillian@g.harvard.edu Harvard University Samuel Daulton∗ sdaulton@g.harvard.edu Harvard University, Facebook† George Konidaris gdk@cs.brown.edu Brown University Finale Doshi-Velez finale@s... | 2017 | 89 |
7,230 | Few-Shot Learning Through an Information Retrieval Lens Eleni Triantafillou University of Toronto Vector Institute Richard Zemel University of Toronto Vector Institute Raquel Urtasun University of Toronto Vector Institute Uber ATG Abstract Few-shot learning refers to understanding new concepts ... | 2017 | 9 |
7,231 | Multi-View Decision Processes: The Helper-AI Problem Christos Dimitrakakis David C. Parkes Chalmers University of Technology & University of Lille Harvard University
Goran Radanovic Paul Tylkin Harvard University Harvard Universit... | 2017 | 90 |
7,232 | Maximum Margin Interval Trees Alexandre Drouin Département d’informatique et de génie logiciel Université Laval, Québec, Canada alexandre.drouin.8@ulaval.ca Toby Dylan Hocking McGill Genome Center McGill University, Montréal, Canada toby.hocking@r-project.org François Laviolette Département d’inform... | 2017 | 91 |
7,233 | Online Learning with a Hint Ofer Dekel Microsoft Research oferd@microsoft.com Arthur Flajolet Operations Research Center Massachusetts Institute of Technology flajolet@mit.edu Nika Haghtalab Computer Science Department Carnegie Mellon University nika@cmu.edu Patrick Jaillet EECS, LIDS, ORC M... | 2017 | 92 |
7,234 | DPSCREEN: Dynamic Personalized Screening Kartik Ahuja Electrical and Computer Engineering Department University of California, Los Angeles ahujak@ucla.edu William R. Zame Economics Department University of California, Los Angeles zame@econ.ucla.edu Mihaela van der Schaar Engineering Science Departme... | 2017 | 93 |
7,235 | Online Learning of Optimal Bidding Strategy in Repeated Multi-Commodity Auctions Sevi Baltaoglu Cornell University Ithaca, NY 14850 msb372@cornell.edu Lang Tong Cornell University Ithaca, NY 14850 lt35@cornell.edu Qing Zhao Cornell University Ithaca, NY 14850 qz16@cornell.edu Abstract We s... | 2017 | 94 |
7,236 | A-NICE-MC: Adversarial Training for MCMC Jiaming Song Stanford University tsong@cs.stanford.edu Shengjia Zhao Stanford University zhaosj12@cs.stanford.edu Stefano Ermon Stanford University ermon@cs.stanford.edu Abstract Existing Markov Chain Monte Carlo (MCMC) methods are either based on generalpu... | 2017 | 95 |
7,237 | Question Asking as Program Generation Anselm Rothe1 anselm@nyu.edu Brenden M. Lake1,2 brenden@nyu.edu Todd M. Gureckis1 todd.gureckis@nyu.edu 1Department of Psychology 2Center for Data Science New York University Abstract A hallmark of human intelligence is the ability to ask rich, creative, and r... | 2017 | 96 |
7,238 | Gradient Methods for Submodular Maximization Hamed Hassani ESE Department University of Pennsylvania Philadelphia, PA hassani@seas.upenn.edu Mahdi Soltanolkotabi EE Department University of Southern California Los Angeles, CA soltanol@usc.edu Amin Karbasi ECE Department Yale University New H... | 2017 | 97 |
7,239 | Recycling Privileged Learning and Distribution Matching for Fairness Novi Quadrianto∗ Predictive Analytics Lab (PAL) University of Sussex Brighton, United Kingdom n.quadrianto@sussex.ac.uk Viktoriia Sharmanska Department of Computing Imperial College London London, United Kingdom sharmanska.v@gmai... | 2017 | 98 |
7,240 | Collecting Telemetry Data Privately Bolin Ding, Janardhan Kulkarni, Sergey Yekhanin Microsoft Research {bolind, jakul, yekhanin}@microsoft.com Abstract The collection and analysis of telemetry data from user’s devices is routinely performed by many software companies. Telemetry collection leads to improved ... | 2017 | 99 |
7,241 | Synthesized Policies for Transfer and Adaptation across Tasks and Environments Hexiang Hu ∗ University of Southern California Los Angeles, CA 90089 hexiangh@usc.edu Liyu Chen ∗ University of Southern California Los Angeles, CA 90089 liyuc@usc.edu Boqing Gong Tencent AI Lab Bellevue, WA 98004 b... | 2018 | 1 |
7,242 | Analytic solution and stationary phase approximation for the Bayesian lasso and elastic net Tom Michoel The Roslin Institute, The University of Edinburgh, UK Computational Biology Unit, Department of Informatics, University of Bergen, Norway tom.michoel@uib.no Abstract The lasso and elastic net linear reg... | 2018 | 10 |
7,243 | Decentralize and Randomize: Faster Algorithm for Wasserstein Barycenters Pavel Dvurechensky, Darina Dvinskikh Weierstrass Institute for Applied Analysis and Stochastics, Institute for Information Transmission Problems RAS {pavel.dvurechensky,darina.dvinskikh}@wias-berlin.de Alexander Gasnikov Moscow Insti... | 2018 | 100 |
7,244 | Thermostat-assisted continuously-tempered Hamiltonian Monte Carlo for Bayesian learning Rui Luo1, Jianhong Wang∗1, Yaodong Yang∗1, Zhanxing Zhu2, and Jun Wang†1 1University College London, 2Peking University Abstract We propose a new sampling method, the thermostat-assisted continuously-tempered Hamiltonian... | 2018 | 1000 |
7,245 | Flexible Neural Representation for Physics Prediction Damian Mrowca1,⇤, Chengxu Zhuang2,⇤, Elias Wang3,⇤, Nick Haber2,4,5 , Li Fei-Fei1 , Joshua B. Tenenbaum7,8 , and Daniel L. K. Yamins1,2,6 Department of Computer Science1, Psychology2, Electrical Engineering3, Pediatrics4 and Biomedical Data Science5, and Wu ... | 2018 | 1001 |
7,246 | A Stein variational Newton method Gianluca Detommaso University of Bath & The Alan Turing Institute gd391@bath.ac.uk Tiangang Cui Monash University Tiangang.Cui@monash.edu Alessio Spantini Massachusetts Institute of Technology spantini@mit.edu Youssef Marzouk Massachusetts Institute of Technology ... | 2018 | 1002 |
7,247 | Dual Swap Disentangling Zunlei Feng Zhejiang University zunleifeng@zju.edu.cn Xinchao Wang Stevens Institute of Technology xinchao.wang@stevens.edu Chenglong Ke Zhejiang University chenglongke@zju.edu.cn Anxiang Zeng Alibaba Group renzhong@taobao.com Dacheng Tao University of Sydney dctao@... | 2018 | 1003 |
7,248 | Algorithmic Regularization in Learning Deep Homogeneous Models: Layers are Automatically Balanced˚ Simon S. Du: Wei Hu; Jason D. Lee§ Abstract We study the implicit regularization imposed by gradient descent for learning multi-layer homogeneous functions including feed-forward fully connected and conv... | 2018 | 1004 |
7,249 | Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima Yaodong Yu⇤ Department of Computer Science University of Virginia Charlottesville, VA 22904 yy8ms@virginia.edu Pan Xu⇤ Department of Computer Science University of California, Los Angeles Los Angeles, CA... | 2018 | 1005 |
7,250 | Robot Learning in Homes: Improving Generalization and Reducing Dataset Bias Abhinav Gupta∗ Adithyavairavan Murali∗ Dhiraj Gandhi∗ Lerrel Pinto∗ The Robotics Institute Carnegie Mellon University Abstract Data-driven approaches to solving robotic tasks have gained a lot of traction in recent years. Ho... | 2018 | 1006 |
7,251 | LAG: Lazily Aggregated Gradient for Communication-Efficient Distributed Learning Tianyi Chen⋆ Georgios B. Giannakis⋆ Tao Sun†,∗ Wotao Yin∗ ⋆University of Minnesota - Twin Cities, Minneapolis, MN 55455, USA †National University of Defense Technology, Changsha, Hunan 410073, China ∗University of California... | 2018 | 1007 |
7,252 | Equality of Opportunity in Classification: A Causal Approach Junzhe Zhang Purdue University, USA zhang745@purdue.edu Elias Bareinboim Purdue University, USA eb@purdue.edu Abstract The Equalized Odds (for short, EO) is one of the most popular measures of discrimination used in the supervised learning se... | 2018 | 1008 |
7,253 | Modern Neural Networks Generalize on Small Data Sets Matthew Olson Department of Statistics Wharton School University of Pennsylvania Philadelphia, PA 19104 maolson@wharton.upenn.edu Abraham J. Wyner Department of Statistics Wharton School University of Pennsylvania Philadelphia, PA 19104 ajw@whar... | 2018 | 1009 |
7,254 | Heterogeneous Multi-output Gaussian Process Prediction Pablo Moreno-Muñoz1 Antonio Artés-Rodríguez1 Mauricio A. Álvarez2 1Dept. of Signal Theory and Communications, Universidad Carlos III de Madrid, Spain 2Dept. of Computer Science, University of Sheffield, UK {pmoreno,antonio}@tsc.uc3m.es, mauricio.alvare... | 2018 | 101 |
7,255 | SNIPER: Efficient Multi-Scale Training Bharat Singh ∗ Mahyar Najibi ∗ Larry S. Davis University of Maryland, College Park {bharat,najibi,lsd}@cs.umd.edu Abstract We present SNIPER, an algorithm for performing efficient multi-scale training in instance level visual recognition tasks. Instead of processing ... | 2018 | 102 |
7,256 | Soft-Gated Warping-GAN for Pose-Guided Person Image Synthesis Haoye Dong1,2 , Xiaodan Liang3,∗, Ke Gong1 , Hanjiang Lai1,2 , Jia Zhu4 , Jian Yin1,2 1School of Data and Computer Science, Sun Yat-sen University 2Guangdong Key Laboratory of Big Data Analysis and Processing, Guangzhou 510006, P.R.China 3School of... | 2018 | 103 |
7,257 | ∆-encoder: an effective sample synthesis method for few-shot object recognition Eli Schwartz*1,2, Leonid Karlinsky*1, Joseph Shtok1, Sivan Harary1, Mattias Marder1, Abhishek Kumar1, Rogerio Feris1, Raja Giryes2 and Alex M. Bronstein3 1IBM Research AI 2School of Electrical Engineering, Tel-Aviv University, T... | 2018 | 104 |
7,258 | A Linear Speedup Analysis of Distributed Deep Learning with Sparse and Quantized Communication Peng Jiang The Ohio State University jiang.952@osu.edu Gagan Agrawal The Ohio State University agrawal@cse.ohio-state.edu Abstract The large communication overhead has imposed a bottleneck on the performance... | 2018 | 105 |
7,259 | Almost Optimal Algorithms for Linear Stochastic Bandits with Heavy-Tailed Payoffs Han Shao∗ Xiaotian Yu∗ Irwin King Michael R. Lyu Department of Computer Science and Engineering The Chinese University of Hong Kong {hshao,xtyu,king,lyu}@cse.cuhk.edu.hk Abstract In linear stochastic bandits, it is com... | 2018 | 106 |
7,260 | Learning towards Minimum Hyperspherical Energy Weiyang Liu1,*, Rongmei Lin2,*, Zhen Liu1,*, Lixin Liu3, Zhiding Yu4, Bo Dai1,5, Le Song1,6 1Georgia Institute of Technology 2Emory University 3South China University of Technology 4NVIDIA 5Google Brain 6Ant Financial Abstract Neural networks are a powerf... | 2018 | 107 |
7,261 | Learning a latent manifold of odor representations from neural responses in piriform cortex Anqi Wu1 Stan L. Pashkovski2 Sandeep Robert Datta2 Jonathan W. Pillow1 1 Princeton Neuroscience Institute, Princeton University, {anqiw, pillow}@princeton.edu 2 Department of Neurobiology, Harvard Medical School,... | 2018 | 108 |
7,262 | Global Gated Mixture of Second-order Pooling for Improving Deep Convolutional Neural Networks Qilong Wang1,2,∗,†, Zilin Gao2,∗, Jiangtao Xie2, Wangmeng Zuo3, Peihua Li2,‡ 1Tianjin University, 2Dalian University of Technology, 3 Harbin Institute of Technology qlwang@tju.edu.cn, gzl@mail.dlut.edu.cn, jiangtaoxie@... | 2018 | 109 |
7,263 | Identification and Estimation Of Causal Effects from Dependent Data Eli Sherman Department of Computer Science Johns Hopkins University Baltimore, MD 21218 esherman@jhu.edu Ilya Shpitser Department of Computer Science Johns Hopkins University Baltimore, MD 21218 ilyas@cs.jhu.edu Abstract The as... | 2018 | 11 |
7,264 | Neural Code Comprehension: A Learnable Representation of Code Semantics Tal Ben-Nun ETH Zurich Zurich 8092, Switzerland talbn@inf.ethz.ch Alice Shoshana Jakobovits ETH Zurich Zurich 8092, Switzerland alicej@student.ethz.ch Torsten Hoefler ETH Zurich Zurich 8092, Switzerland htor@inf.ethz.ch A... | 2018 | 110 |
7,265 | PAC-Bayes Tree: weighted subtrees with guarantees Tin Nguyen∗ MIT EECS tdn@mit.edu Samory Kpotufe Princeton University ORFE samory@princeton.edu Abstract We present a weighted-majority classification approach over subtrees of a fixed tree, which provably achieves excess-risk of the same order as the bes... | 2018 | 111 |
7,266 | Amortized Inference Regularization Rui Shu Stanford University ruishu@stanford.edu Hung H. Bui DeepMind buih@google.com Shengjia Zhao Stanford University sjzhao@stanford.edu Mykel J. Kochenderfer Stanford University mykel@stanford.edu Stefano Ermon Stanford University ermon@cs.stanford.edu... | 2018 | 112 |
7,267 | Structure-Aware Convolutional Neural Networks Jianlong Chang1,2 Jie Gu1,2 Lingfeng Wang1 Gaofeng Meng1 Shiming Xiang1,2 Chunhong Pan1 1NLPR, Institute of Automation, Chinese Academy of Sciences 2School of Artificial Intelligence, University of Chinese Academy of Sciences {jianlong.chang, jie.gu, lfwang... | 2018 | 113 |
7,268 | Alternating Optimization of Decision Trees, with Application to Learning Sparse Oblique Trees Miguel ´A. Carreira-Perpi˜n´an Dept. EECS, University of California, Merced mcarreira-perpinan@ucmerced.edu Pooya Tavallali Dept. EECS, University of California, Merced ptavallali@ucmerced.edu Abstract Learni... | 2018 | 114 |
7,269 | Gradient Descent for Spiking Neural Networks Dongsung Huh Salk Institute La Jolla, CA 92037 huh@salk.edu Terrence J. Sejnowski Salk Institute La Jolla, CA 92037 terry@salk.edu Abstract Most large-scale network models use neurons with static nonlinearities that produce analog output, despite the fact... | 2018 | 115 |
7,270 | Statistical and Computational Trade-Offs in Kernel K-Means Daniele Calandriello LCSL – IIT & MIT, Genoa, Italy Lorenzo Rosasco University of Genoa, LCSL – IIT & MIT Abstract We investigate the efficiency of k-means in terms of both statistical and computational requirements. More precisely, we study a ... | 2018 | 116 |
7,271 | The Spectrum of the Fisher Information Matrix of a Single-Hidden-Layer Neural Network Jeffrey Pennington Google Brain jpennin@google.com Pratik Worah Google Research pworah@google.com Abstract An important factor contributing to the success of deep learning has been the remarkable ability to optimiz... | 2018 | 117 |
7,272 | Parameters as interacting particles: long time convergence and asymptotic error scaling of neural networks Grant M. Rotskoff Courant Institute of Mathematical Sciences New York University rotskoff@cims.nyu.edu Eric Vanden-Eijnden Courant Institute of Mathematical Sciences New York University eve2@ci... | 2018 | 118 |
7,273 | Uplift Modeling from Separate Labels Ikko Yamane1,2 Florian Yger3,2 Jamal Atif3 Masashi Sugiyama2,1 1 The University of Tokyo, CHIBA, JAPAN 2 RIKEN Center for Advanced Intelligence Project (AIP), TOKYO, JAPAN 3 LAMSADE, CNRS, Université Paris-Dauphine, Université PSL, PARIS, FRANCE {yamane@ms., sugi@}k.... | 2018 | 119 |
7,274 | Streamlining Variational Inference for Constraint Satisfaction Problems Aditya Grover, Tudor Achim, Stefano Ermon Computer Science Department Stanford University {adityag, tachim, ermon}@cs.stanford.edu Abstract Several algorithms for solving constraint satisfaction problems are based on survey propagat... | 2018 | 12 |
7,275 | A Bridging Framework for Model Optimization and Deep Propagation Risheng Liu1,2∗, Shichao Cheng3, Xiaokun Liu1, Long Ma1, Xin Fan1,2, Zhongxuan Luo2,3 1International School of Information Science & Engineering, Dalian University of Technology 2Key Laboratory for Ubiquitous Network and Service Software of Liaoni... | 2018 | 120 |
7,276 | Learning filter widths of spectral decompositions with wavelets Haidar Khan Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180 khanh2@rpi.edu Bülent Yener Department of Computer Science Rensselaer Polytechnic Institute Troy, NY 12180 yener@rpi.edu Abstract Time serie... | 2018 | 121 |
7,277 | Autowarp: Learning a Warping Distance from Unlabeled Time Series Using Sequence Autoencoders Abubakar Abid Stanford University a12d@stanford.edu James Zou Stanford University jamesz@stanford.edu Abstract Measuring similarities between unlabeled time series trajectories is an important problem in dom... | 2018 | 122 |
7,278 | Gen-Oja: A Simple and Efficient Algorithm for Streaming Generalized Eigenvector Computation Kush Bhatia∗ University of California, Berkeley kushbhatia@berkeley.edu Aldo Pacchiano∗ University of California, Berkeley pacchiano@berkeley.edu Nicolas Flammarion University of California, Berkeley flammario... | 2018 | 123 |
7,279 | Heterogeneous Bitwidth Binarization in Convolutional Neural Networks Josh Fromm Department of Electrical Engineering University of Washington Seattle, WA 98195 jwfromm@uw.edu Shwetak Patel Department of Computer Science University of Washington Seattle, WA 98195 shwetak@cs.washington.edu Matthai... | 2018 | 124 |
7,280 | BRUNO: A Deep Recurrent Model for Exchangeable Data Iryna Korshunova ♥ Ghent University iryna.korshunova@ugent.be Jonas Degrave ♥† Ghent University jonas.degrave@ugent.be Ferenc Huszár Twitter fhuszar@twitter.com Yarin Gal University of Oxford yarin@cs.ox.ac.uk Arthur Gretton ♠ Gatsby Unit... | 2018 | 125 |
7,281 | Asymptotic optimality of adaptive importance sampling Bernard Delyon IRMAR University of Rennes 1 bernard.delyon@univ-rennes1.fr François Portier Télécom ParisTech University of Paris-Saclay francois.portier@gmail.com Abstract Adaptive importance sampling (AIS) uses past samples to update the samp... | 2018 | 126 |
7,282 | Phase Retrieval Under a Generative Prior Paul Hand⇤ Northeastern University p.hand@northeastern.edu Oscar Leong Rice University oscar.f.leong@rice.edu Vladislav Voroninski Helm.ai vlad@helm.ai Abstract We introduce a novel deep learning inspired formulation of the phase retrieval problem, which ... | 2018 | 127 |
7,283 | Gaussian Process Prior Variational Autoencoders Francesco Paolo Casale†∗, Adrian V Dalca‡§, Luca Saglietti†¶, Jennifer Listgarten♯, Nicolo Fusi† † Microsoft Research New England, Cambridge (MA), USA ‡ Computer Science and Artificial Intelligence Lab, MIT, Cambridge (MA), USA § Martinos Center for Biomedical Im... | 2018 | 128 |
7,284 | Deep Predictive Coding Network with Local Recurrent Processing for Object Recognition Kuan Han1,3, Haiguang Wen1,3, Yizhen Zhang1,3, Di Fu1,3, Eugenio Culurciello1,2, Zhongming Liu1,2,3∗ 1School of Electrical and Computer Engineering, Purdue University 2Weldon School of Biomedical Engineering, Purdue Universi... | 2018 | 129 |
7,285 | A Spectral View of Adversarially Robust Features Shivam Garg Vatsal Sharan∗ Brian Hu Zhang∗ Gregory Valiant Stanford University Stanford, CA 94305 {shivamgarg, vsharan, bhz, gvaliant}@stanford.edu Abstract Given the apparent difficulty of learning models that are robust to adversarial perturbations, we... | 2018 | 13 |
7,286 | Exponentiated Strongly Rayleigh Distributions Zelda Mariet Massachusetts Institute of Technology zelda@csail.mit.edu Suvrit Sra Massachusetts Institute of Technology suvrit@mit.edu Stefanie Jegelka Massachusetts Institute of Technology stefje@csail.mit.edu Abstract Strongly Rayleigh (SR) measures ... | 2018 | 130 |
7,287 | Variational Inference with Tail-adaptive f-Divergence Dilin Wang UT Austin dilin@cs.utexas.edu Hao Liu ∗ UESTC uestcliuhao@gmail.com Qiang Liu UT Austin lqiang@cs.utexas.edu Abstract Variational inference with α-divergences has been widely used in modern probabilistic machine learning. Compared to... | 2018 | 131 |
7,288 | Modelling and unsupervised learning of symmetric deformable object categories James Thewlis1 Hakan Bilen2 Andrea Vedaldi1 1 Visual Geometry Group University of Oxford {jdt,vedaldi}@robots.ox.ac.uk 2 School of Informatics University of Edinburgh hbilen@ed.ac.uk Abstract We propose a new approach ... | 2018 | 132 |
7,289 | Generalizing to Unseen Domains via Adversarial Data Augmentation Riccardo Volpi∗,† Istituto Italiano di Tecnologia Hongseok Namkoong∗ Stanford University Ozan Sener Intel Labs John Duchi Stanford University Vittorio Murino Istituto Italiano di Tecnologia Università di Verona Silvio Savarese ... | 2018 | 133 |
7,290 | Information-theoretic Limits for Community Detection in Network Models Chuyang Ke Department of Computer Science Purdue University West Lafayette, IN 47907 cke@purdue.edu Jean Honorio Department of Computer Science Purdue University West Lafayette, IN 47907 jhonorio@purdue.edu Abstract We anal... | 2018 | 134 |
7,291 | Dendritic cortical microcircuits approximate the backpropagation algorithm João Sacramento⇤ Department of Physiology University of Bern, Switzerland sacramento@pyl.unibe.ch Rui Ponte Costa† Department of Physiology University of Bern, Switzerland costa@pyl.unibe.ch Yoshua Bengio‡ Mila and Universi... | 2018 | 135 |
7,292 | Structured Local Minima in Sparse Blind Deconvolution Yuqian Zhang, Han-Wen Kuo, John Wright Department of Electrical Engineer and Data Science Institute Columbia University, New York, NY 10027 {yz2409, hk2673, jw2966}@columbia.edu Abstract Blind deconvolution is a ubiquitous problem of recovering two unk... | 2018 | 136 |
7,293 | Solving Non-smooth Constrained Programs with Lower Complexity than O(1/"): A Primal-Dual Homotopy Smoothing Approach Xiaohan Wei Department of Electrical Engineering University of Southern California Los Angeles, CA, USA, 90089 xiaohanw@usc.edu Hao Yu Alibaba Group (U.S.) Inc. Bellevue, WA, USA, 980... | 2018 | 137 |
7,294 | Unsupervised Cross-Modal Alignment of Speech and Text Embedding Spaces Yu-An Chung, Wei-Hung Weng, Schrasing Tong, and James Glass Computer Science and Artificial Intelligence Laboratory Massachusetts Institute of Technology Cambridge, MA 02139, USA {andyyuan,ckbjimmy,st9,glass}@mit.edu Abstract Recent r... | 2018 | 138 |
7,295 | Isolating Sources of Disentanglement in VAEs Ricky T. Q. Chen, Xuechen Li, Roger Grosse, David Duvenaud University of Toronto, Vector Institute
Abstract We decompose the evidence lower bound to show the existence of a term measuring the total correlatio... | 2018 | 139 |
7,296 | Dimensionality Reduction has Quantifiable Imperfections: Two Geometric Bounds Kry Yik Chau Lui Borealis AI Canada yikchau.y.lui@borealisai.com Gavin Weiguang Ding Borealis AI Canada gavin.ding@borealisai.com Ruitong Huang Borealis AI Canada ruitong.huang@borealisai.com Robert J. McCann Depa... | 2018 | 14 |
7,297 | Learning to Share and Hide Intentions using Information Regularization DJ Strouse1, Max Kleiman-Weiner2, Josh Tenenbaum2 Matt Botvinick3,4, David Schwab5 1 Princeton University, 2 MIT, 3 DeepMind 4 UCL, 5 CUNY Graduate Center Abstract Learning to cooperate with friends and compete with foes is a key compo... | 2018 | 140 |
7,298 | Why Is My Classifier Discriminatory? Irene Y. Chen MIT iychen@mit.edu Fredrik D. Johansson MIT fredrikj@mit.edu David Sontag MIT dsontag@csail.mit.edu Abstract Recent attempts to achieve fairness in predictive models focus on the balance between fairness and accuracy. In sensitive applications su... | 2018 | 141 |
7,299 | Unsupervised Learning of Object Landmarks through Conditional Image Generation Tomas Jakab1∗ Ankush Gupta1∗ Hakan Bilen2 Andrea Vedaldi1 1 Visual Geometry Group University of Oxford {tomj,ankush,vedaldi}@robots.ox.ac.uk 2 School of Informatics University of Edinburgh hbilen@ed.ac.uk Abstract W... | 2018 | 142 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.