Dataset Viewer
Auto-converted to Parquet Duplicate
title
stringlengths
15
153
url
stringlengths
97
97
authors
stringlengths
6
328
detail_url
stringlengths
97
97
tags
stringclasses
1 value
Bibtex
stringlengths
54
54
Paper
stringlengths
93
93
Reviews And Public Comment »
stringlengths
63
65
Supplemental
stringlengths
100
100
abstract
stringlengths
310
2.42k
Supplemental Errata
stringclasses
1 value
Beyond Value-Function Gaps: Improved Instance-Dependent Regret Bounds for Episodic Reinforcement Learning
https://papers.nips.cc/paper_files/paper/2021/hash/000c076c390a4c357313fca29e390ece-Abstract.html
Christoph Dann, Teodor Vanislavov Marinov, Mehryar Mohri, Julian Zimmert
https://papers.nips.cc/paper_files/paper/2021/hash/000c076c390a4c357313fca29e390ece-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11624-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/000c076c390a4c357313fca29e390ece-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=CU8qQMhB3dh
https://papers.nips.cc/paper_files/paper/2021/file/000c076c390a4c357313fca29e390ece-Supplemental.pdf
We provide improved gap-dependent regret bounds for reinforcement learning in finite episodic Markov decision processes. Compared to prior work, our bounds depend on alternative definitions of gaps. These definitions are based on the insight that, in order to achieve a favorable regret, an algorithm does not need to le...
null
Learning One Representation to Optimize All Rewards
https://papers.nips.cc/paper_files/paper/2021/hash/003dd617c12d444ff9c80f717c3fa982-Abstract.html
Ahmed Touati, Yann Ollivier
https://papers.nips.cc/paper_files/paper/2021/hash/003dd617c12d444ff9c80f717c3fa982-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11625-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/003dd617c12d444ff9c80f717c3fa982-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=2a96Bf7Qdrg
https://papers.nips.cc/paper_files/paper/2021/file/003dd617c12d444ff9c80f717c3fa982-Supplemental.pdf
We introduce the forward-backward (FB) representation of the dynamics of a reward-free Markov decision process. It provides explicit near-optimal policies for any reward specified a posteriori. During an unsupervised phase, we use reward-free interactions with the environment to learn two representations via off-the-sh...
null
Matrix factorisation and the interpretation of geodesic distance
https://papers.nips.cc/paper_files/paper/2021/hash/007ff380ee5ac49ffc34442f5c2a2b86-Abstract.html
Nick Whiteley, Annie Gray, Patrick Rubin-Delanchy
https://papers.nips.cc/paper_files/paper/2021/hash/007ff380ee5ac49ffc34442f5c2a2b86-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11626-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/007ff380ee5ac49ffc34442f5c2a2b86-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=gwP8pc1OgN_
https://papers.nips.cc/paper_files/paper/2021/file/007ff380ee5ac49ffc34442f5c2a2b86-Supplemental.pdf
Given a graph or similarity matrix, we consider the problem of recovering a notion of true distance between the nodes, and so their true positions. We show that this can be accomplished in two steps: matrix factorisation, followed by nonlinear dimension reduction. This combination is effective because the point cloud o...
null
UniDoc: Unified Pretraining Framework for Document Understanding
https://papers.nips.cc/paper_files/paper/2021/hash/0084ae4bc24c0795d1e6a4f58444d39b-Abstract.html
Jiuxiang Gu, Jason Kuen, Vlad I Morariu, Handong Zhao, Rajiv Jain, Nikolaos Barmpalios, Ani Nenkova, Tong Sun
https://papers.nips.cc/paper_files/paper/2021/hash/0084ae4bc24c0795d1e6a4f58444d39b-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11627-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0084ae4bc24c0795d1e6a4f58444d39b-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=UMcd6l1msUK
null
Document intelligence automates the extraction of information from documents and supports many business applications. Recent self-supervised learning methods on large-scale unlabeled document datasets have opened up promising directions towards reducing annotation efforts by training models with self-supervised objecti...
null
Finding Discriminative Filters for Specific Degradations in Blind Super-Resolution
https://papers.nips.cc/paper_files/paper/2021/hash/008bd5ad93b754d500338c253d9c1770-Abstract.html
Liangbin Xie, Xintao Wang, Chao Dong, Zhongang Qi, Ying Shan
https://papers.nips.cc/paper_files/paper/2021/hash/008bd5ad93b754d500338c253d9c1770-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11628-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/008bd5ad93b754d500338c253d9c1770-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=az0BBDjDvwD
https://papers.nips.cc/paper_files/paper/2021/file/008bd5ad93b754d500338c253d9c1770-Supplemental.pdf
Recent blind super-resolution (SR) methods typically consist of two branches, one for degradation prediction and the other for conditional restoration. However, our experiments show that a one-branch network can achieve comparable performance to the two-branch scheme. Then we wonder: how can one-branch networks automat...
null
Counterfactual Explanations Can Be Manipulated
https://papers.nips.cc/paper_files/paper/2021/hash/009c434cab57de48a31f6b669e7ba266-Abstract.html
Dylan Slack, Anna Hilgard, Himabindu Lakkaraju, Sameer Singh
https://papers.nips.cc/paper_files/paper/2021/hash/009c434cab57de48a31f6b669e7ba266-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11629-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/009c434cab57de48a31f6b669e7ba266-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=iaO_IH7CnGJ
https://papers.nips.cc/paper_files/paper/2021/file/009c434cab57de48a31f6b669e7ba266-Supplemental.pdf
Counterfactual explanations are emerging as an attractive option for providing recourse to individuals adversely impacted by algorithmic decisions. As they are deployed in critical applications (e.g. law enforcement, financial lending), it becomes important to ensure that we clearly understand the vulnerabilties of th...
null
From Canonical Correlation Analysis to Self-supervised Graph Neural Networks
https://papers.nips.cc/paper_files/paper/2021/hash/00ac8ed3b4327bdd4ebbebcb2ba10a00-Abstract.html
Hengrui Zhang, Qitian Wu, Junchi Yan, David Wipf, Philip S Yu
https://papers.nips.cc/paper_files/paper/2021/hash/00ac8ed3b4327bdd4ebbebcb2ba10a00-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11630-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/00ac8ed3b4327bdd4ebbebcb2ba10a00-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=X3TdREzbZN
https://papers.nips.cc/paper_files/paper/2021/file/00ac8ed3b4327bdd4ebbebcb2ba10a00-Supplemental.pdf
We introduce a conceptually simple yet effective model for self-supervised representation learning with graph data. It follows the previous methods that generate two views of an input graph through data augmentation. However, unlike contrastive methods that focus on instance-level discrimination, we optimize an innovat...
null
BAST: Bayesian Additive Regression Spanning Trees for Complex Constrained Domain
https://papers.nips.cc/paper_files/paper/2021/hash/00b76fddeaaa7d8c2c43d504b2babd8a-Abstract.html
Zhao Tang Luo, Huiyan Sang, Bani Mallick
https://papers.nips.cc/paper_files/paper/2021/hash/00b76fddeaaa7d8c2c43d504b2babd8a-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11631-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/00b76fddeaaa7d8c2c43d504b2babd8a-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=Yw7ZNeDVpBS
https://papers.nips.cc/paper_files/paper/2021/file/00b76fddeaaa7d8c2c43d504b2babd8a-Supplemental.pdf
Nonparametric regression on complex domains has been a challenging task as most existing methods, such as ensemble models based on binary decision trees, are not designed to account for intrinsic geometries and domain boundaries. This article proposes a Bayesian additive regression spanning trees (BAST) model for nonpa...
null
Hyperbolic Busemann Learning with Ideal Prototypes
https://papers.nips.cc/paper_files/paper/2021/hash/01259a0cb2431834302abe2df60a1327-Abstract.html
Mina Ghadimi Atigh, Martin Keller-Ressel, Pascal Mettes
https://papers.nips.cc/paper_files/paper/2021/hash/01259a0cb2431834302abe2df60a1327-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11632-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01259a0cb2431834302abe2df60a1327-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=c_XcmuxwAY
https://papers.nips.cc/paper_files/paper/2021/file/01259a0cb2431834302abe2df60a1327-Supplemental.zip
Hyperbolic space has become a popular choice of manifold for representation learning of various datatypes from tree-like structures and text to graphs. Building on the success of deep learning with prototypes in Euclidean and hyperspherical spaces, a few recent works have proposed hyperbolic prototypes for classificati...
null
Backward-Compatible Prediction Updates: A Probabilistic Approach
https://papers.nips.cc/paper_files/paper/2021/hash/012d9fe15b2493f21902cd55603382ec-Abstract.html
Frederik Träuble, Julius von Kügelgen, Matthäus Kleindessner, Francesco Locatello, Bernhard Schölkopf, Peter Gehler
https://papers.nips.cc/paper_files/paper/2021/hash/012d9fe15b2493f21902cd55603382ec-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11633-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/012d9fe15b2493f21902cd55603382ec-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=YjZoWjTKYvH
https://papers.nips.cc/paper_files/paper/2021/file/012d9fe15b2493f21902cd55603382ec-Supplemental.pdf
When machine learning systems meet real world applications, accuracy is only one of several requirements. In this paper, we assay a complementary perspective originating from the increasing availability of pre-trained and regularly improving state-of-the-art models. While new improved models develop at a fast pace, dow...
null
Truncated Marginal Neural Ratio Estimation
https://papers.nips.cc/paper_files/paper/2021/hash/01632f7b7a127233fa1188bd6c2e42e1-Abstract.html
Benjamin K Miller, Alex Cole, Patrick Forré, Gilles Louppe, Christoph Weniger
https://papers.nips.cc/paper_files/paper/2021/hash/01632f7b7a127233fa1188bd6c2e42e1-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11634-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01632f7b7a127233fa1188bd6c2e42e1-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=VA18aFPYfkd
https://papers.nips.cc/paper_files/paper/2021/file/01632f7b7a127233fa1188bd6c2e42e1-Supplemental.pdf
Parametric stochastic simulators are ubiquitous in science, often featuring high-dimensional input parameters and/or an intractable likelihood. Performing Bayesian parameter inference in this context can be challenging. We present a neural simulation-based inference algorithm which simultaneously offers simulation effi...
null
ReAct: Out-of-distribution Detection With Rectified Activations
https://papers.nips.cc/paper_files/paper/2021/hash/01894d6f048493d2cacde3c579c315a3-Abstract.html
Yiyou Sun, Chuan Guo, Yixuan Li
https://papers.nips.cc/paper_files/paper/2021/hash/01894d6f048493d2cacde3c579c315a3-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11635-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01894d6f048493d2cacde3c579c315a3-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=IBVBtz_sRSm
https://papers.nips.cc/paper_files/paper/2021/file/01894d6f048493d2cacde3c579c315a3-Supplemental.pdf
Out-of-distribution (OOD) detection has received much attention lately due to its practical importance in enhancing the safe deployment of neural networks. One of the primary challenges is that models often produce highly confident predictions on OOD data, which undermines the driving principle in OOD detection that th...
null
Non-local Latent Relation Distillation for Self-Adaptive 3D Human Pose Estimation
https://papers.nips.cc/paper_files/paper/2021/hash/018b59ce1fd616d874afad0f44ba338d-Abstract.html
Jogendra Nath Kundu, Siddharth Seth, Anirudh Jamkhandi, Pradyumna YM, Varun Jampani, Anirban Chakraborty, Venkatesh Babu R
https://papers.nips.cc/paper_files/paper/2021/hash/018b59ce1fd616d874afad0f44ba338d-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11636-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/018b59ce1fd616d874afad0f44ba338d-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=AIQOddM5Xm
https://papers.nips.cc/paper_files/paper/2021/file/018b59ce1fd616d874afad0f44ba338d-Supplemental.pdf
Available 3D human pose estimation approaches leverage different forms of strong (2D/3D pose) or weak (multi-view or depth) paired supervision. Barring synthetic or in-studio domains, acquiring such supervision for each new target environment is highly inconvenient. To this end, we cast 3D pose learning as a self-super...
null
Fast Training of Neural Lumigraph Representations using Meta Learning
https://papers.nips.cc/paper_files/paper/2021/hash/01931a6925d3de09e5f87419d9d55055-Abstract.html
Alexander Bergman, Petr Kellnhofer, Gordon Wetzstein
https://papers.nips.cc/paper_files/paper/2021/hash/01931a6925d3de09e5f87419d9d55055-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11637-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01931a6925d3de09e5f87419d9d55055-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=XCaZKu00a_D
https://papers.nips.cc/paper_files/paper/2021/file/01931a6925d3de09e5f87419d9d55055-Supplemental.pdf
Novel view synthesis is a long-standing problem in machine learning and computer vision. Significant progress has recently been made in developing neural scene representations and rendering techniques that synthesize photorealistic images from arbitrary views. These representations, however, are extremely slow to train...
null
Analytical Study of Momentum-Based Acceleration Methods in Paradigmatic High-Dimensional Non-Convex Problems
https://papers.nips.cc/paper_files/paper/2021/hash/019f8b946a256d9357eadc5ace2c8678-Abstract.html
Stefano Sarao Mannelli, Pierfrancesco Urbani
https://papers.nips.cc/paper_files/paper/2021/hash/019f8b946a256d9357eadc5ace2c8678-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11638-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/019f8b946a256d9357eadc5ace2c8678-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=KnAMQ3nH8Pq
https://papers.nips.cc/paper_files/paper/2021/file/019f8b946a256d9357eadc5ace2c8678-Supplemental.pdf
The optimization step in many machine learning problems rarely relies on vanilla gradient descent but it is common practice to use momentum-based accelerated methods. Despite these algorithms being widely applied to arbitrary loss functions, their behaviour in generically non-convex, high dimensional landscapes is poor...
null
Multimodal Few-Shot Learning with Frozen Language Models
https://papers.nips.cc/paper_files/paper/2021/hash/01b7575c38dac42f3cfb7d500438b875-Abstract.html
Maria Tsimpoukelli, Jacob L Menick, Serkan Cabi, S. M. Ali Eslami, Oriol Vinyals, Felix Hill
https://papers.nips.cc/paper_files/paper/2021/hash/01b7575c38dac42f3cfb7d500438b875-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11639-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01b7575c38dac42f3cfb7d500438b875-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=WtmMyno9Tq2
https://papers.nips.cc/paper_files/paper/2021/file/01b7575c38dac42f3cfb7d500438b875-Supplemental.pdf
When trained at sufficient scale, auto-regressive language models exhibit the notable ability to learn a new language task after being prompted with just a few examples. Here, we present a simple, yet effective, approach for transferring this few-shot learning ability to a multimodal setting (vision and language). Usin...
null
Approximating the Permanent with Deep Rejection Sampling
https://papers.nips.cc/paper_files/paper/2021/hash/01d8bae291b1e4724443375634ccfa0e-Abstract.html
Juha Harviainen, Antti Röyskö, Mikko Koivisto
https://papers.nips.cc/paper_files/paper/2021/hash/01d8bae291b1e4724443375634ccfa0e-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11640-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01d8bae291b1e4724443375634ccfa0e-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=mgkxmKYW62
https://papers.nips.cc/paper_files/paper/2021/file/01d8bae291b1e4724443375634ccfa0e-Supplemental.zip
We present a randomized approximation scheme for the permanent of a matrix with nonnegative entries. Our scheme extends a recursive rejection sampling method of Huber and Law (SODA 2008) by replacing the permanent upper bound with a linear combination of the subproblem bounds at a moderately large depth of the recursio...
null
Revisiting Model Stitching to Compare Neural Representations
https://papers.nips.cc/paper_files/paper/2021/hash/01ded4259d101feb739b06c399e9cd9c-Abstract.html
Yamini Bansal, Preetum Nakkiran, Boaz Barak
https://papers.nips.cc/paper_files/paper/2021/hash/01ded4259d101feb739b06c399e9cd9c-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11641-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01ded4259d101feb739b06c399e9cd9c-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=ak06J5jNR4
https://papers.nips.cc/paper_files/paper/2021/file/01ded4259d101feb739b06c399e9cd9c-Supplemental.pdf
We revisit and extend model stitching (Lenc & Vedaldi 2015) as a methodology to study the internal representations of neural networks. Given two trained and frozen models $A$ and $B$, we consider a "stitched model" formed by connecting the bottom-layers of $A$ to the top-layers of $B$, with a simple trainable layer bet...
null
AugMax: Adversarial Composition of Random Augmentations for Robust Training
https://papers.nips.cc/paper_files/paper/2021/hash/01e9565cecc4e989123f9620c1d09c09-Abstract.html
Haotao Wang, Chaowei Xiao, Jean Kossaifi, Zhiding Yu, Anima Anandkumar, Zhangyang Wang
https://papers.nips.cc/paper_files/paper/2021/hash/01e9565cecc4e989123f9620c1d09c09-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11642-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/01e9565cecc4e989123f9620c1d09c09-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=P5MtdcVdFZ4
https://papers.nips.cc/paper_files/paper/2021/file/01e9565cecc4e989123f9620c1d09c09-Supplemental.pdf
Data augmentation is a simple yet effective way to improve the robustness of deep neural networks (DNNs). Diversity and hardness are two complementary dimensions of data augmentation to achieve robustness. For example, AugMix explores random compositions of a diverse set of augmentations to enhance broader coverage, wh...
null
Habitat 2.0: Training Home Assistants to Rearrange their Habitat
https://papers.nips.cc/paper_files/paper/2021/hash/021bbc7ee20b71134d53e20206bd6feb-Abstract.html
Andrew Szot, Alexander Clegg, Eric Undersander, Erik Wijmans, Yili Zhao, John Turner, Noah Maestre, Mustafa Mukadam, Devendra Singh Chaplot, Oleksandr Maksymets, Aaron Gokaslan, Vladimír Vondruš, Sameer Dharur, Franziska Meier, Wojciech Galuba, Angel Chang, Zsolt Kira, Vladlen Koltun, Jitendra Malik, Manolis Savva, Dhr...
https://papers.nips.cc/paper_files/paper/2021/hash/021bbc7ee20b71134d53e20206bd6feb-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11643-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/021bbc7ee20b71134d53e20206bd6feb-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=DPHsCQ8OpA
https://papers.nips.cc/paper_files/paper/2021/file/021bbc7ee20b71134d53e20206bd6feb-Supplemental.pdf
We introduce Habitat 2.0 (H2.0), a simulation platform for training virtual robots in interactive 3D environments and complex physics-enabled scenarios. We make comprehensive contributions to all levels of the embodied AI stack – data, simulation, and benchmark tasks. Specifically, we present: (i) ReplicaCAD: an artist...
null
Time Discretization-Invariant Safe Action Repetition for Policy Gradient Methods
https://papers.nips.cc/paper_files/paper/2021/hash/024677efb8e4aee2eaeef17b54695bbe-Abstract.html
Seohong Park, Jaekyeom Kim, Gunhee Kim
https://papers.nips.cc/paper_files/paper/2021/hash/024677efb8e4aee2eaeef17b54695bbe-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11644-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/024677efb8e4aee2eaeef17b54695bbe-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=xNmhYNQruJX
https://papers.nips.cc/paper_files/paper/2021/file/024677efb8e4aee2eaeef17b54695bbe-Supplemental.pdf
In reinforcement learning, continuous time is often discretized by a time scale $\delta$, to which the resulting performance is known to be highly sensitive. In this work, we seek to find a $\delta$-invariant algorithm for policy gradient (PG) methods, which performs well regardless of the value of $\delta$. We first i...
null
Meta-Learning Reliable Priors in the Function Space
https://papers.nips.cc/paper_files/paper/2021/hash/024d2d699e6c1a82c9ba986386f4d824-Abstract.html
Jonas Rothfuss, Dominique Heyn, jinfan Chen, Andreas Krause
https://papers.nips.cc/paper_files/paper/2021/hash/024d2d699e6c1a82c9ba986386f4d824-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11645-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/024d2d699e6c1a82c9ba986386f4d824-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=H_qljL8t_A
https://papers.nips.cc/paper_files/paper/2021/file/024d2d699e6c1a82c9ba986386f4d824-Supplemental.pdf
Meta-Learning promises to enable more data-efficient inference by harnessing previous experience from related learning tasks. While existing meta-learning methods help us to improve the accuracy of our predictions in face of data scarcity, they fail to supply reliable uncertainty estimates, often being grossly overconf...
null
VoiceMixer: Adversarial Voice Style Mixup
https://papers.nips.cc/paper_files/paper/2021/hash/0266e33d3f546cb5436a10798e657d97-Abstract.html
Sang-Hoon Lee, Ji-Hoon Kim, Hyunseung Chung, Seong-Whan Lee
https://papers.nips.cc/paper_files/paper/2021/hash/0266e33d3f546cb5436a10798e657d97-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11646-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0266e33d3f546cb5436a10798e657d97-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=1Sy9EwFCyFQ
null
Although recent advances in voice conversion have shown significant improvement, there still remains a gap between the converted voice and target voice. A key factor that maintains this gap is the insufficient decomposition of content and voice style from the source speech. This insufficiency leads to the converted spe...
null
Predicting What You Already Know Helps: Provable Self-Supervised Learning
https://papers.nips.cc/paper_files/paper/2021/hash/02e656adee09f8394b402d9958389b7d-Abstract.html
Jason D. Lee, Qi Lei, Nikunj Saunshi, JIACHENG ZHUO
https://papers.nips.cc/paper_files/paper/2021/hash/02e656adee09f8394b402d9958389b7d-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11647-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/02e656adee09f8394b402d9958389b7d-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=Yx1OzVU_SRi
https://papers.nips.cc/paper_files/paper/2021/file/02e656adee09f8394b402d9958389b7d-Supplemental.pdf
Self-supervised representation learning solves auxiliary prediction tasks (known as pretext tasks), that do not require labeled data, to learn semantic representations. These pretext tasks are created solely using the input features, such as predicting a missing image patch, recovering the color channels of an image fr...
null
Oracle Complexity in Nonsmooth Nonconvex Optimization
https://papers.nips.cc/paper_files/paper/2021/hash/030e65da2b1c944090548d36b244b28d-Abstract.html
Guy Kornowski, Ohad Shamir
https://papers.nips.cc/paper_files/paper/2021/hash/030e65da2b1c944090548d36b244b28d-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11648-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/030e65da2b1c944090548d36b244b28d-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=aMZJBOiOOPg
https://papers.nips.cc/paper_files/paper/2021/file/030e65da2b1c944090548d36b244b28d-Supplemental.pdf
It is well-known that given a smooth, bounded-from-below, and possibly nonconvex function, standard gradient-based methods can find $\epsilon$-stationary points (with gradient norm less than $\epsilon$) in $\mathcal{O}(1/\epsilon^2)$ iterations. However, many important nonconvex optimization problems, such as those ass...
null
CentripetalText: An Efficient Text Instance Representation for Scene Text Detection
https://papers.nips.cc/paper_files/paper/2021/hash/03227b950778ab86436ff79fe975b596-Abstract.html
Tao Sheng, Jie Chen, Zhouhui Lian
https://papers.nips.cc/paper_files/paper/2021/hash/03227b950778ab86436ff79fe975b596-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11649-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/03227b950778ab86436ff79fe975b596-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=z1F9G4VnGZ-
https://papers.nips.cc/paper_files/paper/2021/file/03227b950778ab86436ff79fe975b596-Supplemental.pdf
Scene text detection remains a grand challenge due to the variation in text curvatures, orientations, and aspect ratios. One of the hardest problems in this task is how to represent text instances of arbitrary shapes. Although many methods have been proposed to model irregular texts in a flexible manner, most of them l...
null
Learning to Select Exogenous Events for Marked Temporal Point Process
https://papers.nips.cc/paper_files/paper/2021/hash/032abcd424b4312e7087f434ef1c0094-Abstract.html
Ping Zhang, Rishabh Iyer, Ashish Tendulkar, Gaurav Aggarwal, Abir De
https://papers.nips.cc/paper_files/paper/2021/hash/032abcd424b4312e7087f434ef1c0094-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11650-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/032abcd424b4312e7087f434ef1c0094-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=MckiHYXsBT
https://papers.nips.cc/paper_files/paper/2021/file/032abcd424b4312e7087f434ef1c0094-Supplemental.pdf
Marked temporal point processes (MTPPs) have emerged as a powerful modelingtool for a wide variety of applications which are characterized using discreteevents localized in continuous time. In this context, the events are of two typesendogenous events which occur due to the influence of the previous events andexogenous...
null
DRIVE: One-bit Distributed Mean Estimation
https://papers.nips.cc/paper_files/paper/2021/hash/0397758f8990c1b41b81b43ac389ab9f-Abstract.html
Shay Vargaftik, Ran Ben-Basat, Amit Portnoy, Gal Mendelson, Yaniv Ben-Itzhak, Michael Mitzenmacher
https://papers.nips.cc/paper_files/paper/2021/hash/0397758f8990c1b41b81b43ac389ab9f-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11651-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0397758f8990c1b41b81b43ac389ab9f-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=KXRTmcv3dQ8
https://papers.nips.cc/paper_files/paper/2021/file/0397758f8990c1b41b81b43ac389ab9f-Supplemental.pdf
We consider the problem where $n$ clients transmit $d$-dimensional real-valued vectors using $d(1+o(1))$ bits each, in a manner that allows the receiver to approximately reconstruct their mean. Such compression problems naturally arise in distributed and federated learning. We provide novel mathematical results and der...
null
Learning Space Partitions for Path Planning
https://papers.nips.cc/paper_files/paper/2021/hash/03a3655fff3e9bdea48de9f49e938e32-Abstract.html
Kevin Yang, Tianjun Zhang, Chris Cummins, Brandon Cui, Benoit Steiner, Linnan Wang, Joseph E. Gonzalez, Dan Klein, Yuandong Tian
https://papers.nips.cc/paper_files/paper/2021/hash/03a3655fff3e9bdea48de9f49e938e32-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11652-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/03a3655fff3e9bdea48de9f49e938e32-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=LT5QcAeuM15
https://papers.nips.cc/paper_files/paper/2021/file/03a3655fff3e9bdea48de9f49e938e32-Supplemental.pdf
Path planning, the problem of efficiently discovering high-reward trajectories, often requires optimizing a high-dimensional and multimodal reward function. Popular approaches like CEM and CMA-ES greedily focus on promising regions of the search space and may get trapped in local maxima. DOO and VOOT balance exploratio...
null
Progressive Feature Interaction Search for Deep Sparse Network
https://papers.nips.cc/paper_files/paper/2021/hash/03b2ceb73723f8b53cd533e4fba898ee-Abstract.html
Chen Gao, Yinfeng Li, Quanming Yao, Depeng Jin, Yong Li
https://papers.nips.cc/paper_files/paper/2021/hash/03b2ceb73723f8b53cd533e4fba898ee-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11653-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/03b2ceb73723f8b53cd533e4fba898ee-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=rl2FreDHTb0
https://papers.nips.cc/paper_files/paper/2021/file/03b2ceb73723f8b53cd533e4fba898ee-Supplemental.pdf
Deep sparse networks (DSNs), of which the crux is exploring the high-order feature interactions, have become the state-of-the-art on the prediction task with high-sparsity features. However, these models suffer from low computation efficiency, including large model size and slow model inference, which largely limits th...
null
Local Explanation of Dialogue Response Generation
https://papers.nips.cc/paper_files/paper/2021/hash/03b92cd507ff5870df0db7f074728830-Abstract.html
Yi-Lin Tuan, Connor Pryor, Wenhu Chen, Lise Getoor, William Yang Wang
https://papers.nips.cc/paper_files/paper/2021/hash/03b92cd507ff5870df0db7f074728830-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11654-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/03b92cd507ff5870df0db7f074728830-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=1Av2E0EugkA
https://papers.nips.cc/paper_files/paper/2021/file/03b92cd507ff5870df0db7f074728830-Supplemental.pdf
In comparison to the interpretation of classification models, the explanation of sequence generation models is also an important problem, however it has seen little attention. In this work, we study model-agnostic explanations of a representative text generation task -- dialogue response generation. Dialog response gen...
null
Scalable Inference in SDEs by Direct Matching of the Fokker–Planck–Kolmogorov Equation
https://papers.nips.cc/paper_files/paper/2021/hash/03e4d3f831100d4355663f3d425d716b-Abstract.html
Arno Solin, Ella Tamir, Prakhar Verma
https://papers.nips.cc/paper_files/paper/2021/hash/03e4d3f831100d4355663f3d425d716b-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11655-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/03e4d3f831100d4355663f3d425d716b-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=admg0sZZm1e
https://papers.nips.cc/paper_files/paper/2021/file/03e4d3f831100d4355663f3d425d716b-Supplemental.pdf
Simulation-based techniques such as variants of stochastic Runge–Kutta are the de facto approach for inference with stochastic differential equations (SDEs) in machine learning. These methods are general-purpose and used with parametric and non-parametric models, and neural SDEs. Stochastic Runge–Kutta relies on the us...
null
The Complexity of Bayesian Network Learning: Revisiting the Superstructure
https://papers.nips.cc/paper_files/paper/2021/hash/040a99f23e8960763e680041c601acab-Abstract.html
Robert Ganian, Viktoriia Korchemna
https://papers.nips.cc/paper_files/paper/2021/hash/040a99f23e8960763e680041c601acab-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11656-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/040a99f23e8960763e680041c601acab-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=vY2HsMWG2b_
https://papers.nips.cc/paper_files/paper/2021/file/040a99f23e8960763e680041c601acab-Supplemental.pdf
We investigate the parameterized complexity of Bayesian Network Structure Learning (BNSL), a classical problem that has received significant attention in empirical but also purely theoretical studies. We follow up on previous works that have analyzed the complexity of BNSL w.r.t. the so-called superstructure of the inp...
null
Fast Tucker Rank Reduction for Non-Negative Tensors Using Mean-Field Approximation
https://papers.nips.cc/paper_files/paper/2021/hash/040ca38cefb1d9226d79c05dd25469cb-Abstract.html
Kazu Ghalamkari, Mahito Sugiyama
https://papers.nips.cc/paper_files/paper/2021/hash/040ca38cefb1d9226d79c05dd25469cb-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11657-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/040ca38cefb1d9226d79c05dd25469cb-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=RwdHpzTTGl
https://papers.nips.cc/paper_files/paper/2021/file/040ca38cefb1d9226d79c05dd25469cb-Supplemental.pdf
We present an efficient low-rank approximation algorithm for non-negative tensors. The algorithm is derived from our two findings: First, we show that rank-1 approximation for tensors can be viewed as a mean-field approximation by treating each tensor as a probability distribution. Second, we theoretically provide a s...
null
Learning Stochastic Majority Votes by Minimizing a PAC-Bayes Generalization Bound
https://papers.nips.cc/paper_files/paper/2021/hash/0415740eaa4d9decbc8da001d3fd805f-Abstract.html
Valentina Zantedeschi, Paul Viallard, Emilie Morvant, Rémi Emonet, Amaury Habrard, Pascal Germain, Benjamin Guedj
https://papers.nips.cc/paper_files/paper/2021/hash/0415740eaa4d9decbc8da001d3fd805f-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11658-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0415740eaa4d9decbc8da001d3fd805f-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=2Lq5mDVwBdJ
https://papers.nips.cc/paper_files/paper/2021/file/0415740eaa4d9decbc8da001d3fd805f-Supplemental.pdf
We investigate a stochastic counterpart of majority votes over finite ensembles of classifiers, and study its generalization properties. While our approach holds for arbitrary distributions, we instantiate it with Dirichlet distributions: this allows for a closed-form and differentiable expression for the expected risk...
null
Numerical influence of ReLU’(0) on backpropagation
https://papers.nips.cc/paper_files/paper/2021/hash/043ab21fc5a1607b381ac3896176dac6-Abstract.html
David Bertoin, Jérôme Bolte, Sébastien Gerchinovitz, Edouard Pauwels
https://papers.nips.cc/paper_files/paper/2021/hash/043ab21fc5a1607b381ac3896176dac6-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11659-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/043ab21fc5a1607b381ac3896176dac6-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=urrcVI-_jRm
https://papers.nips.cc/paper_files/paper/2021/file/043ab21fc5a1607b381ac3896176dac6-Supplemental.pdf
In theory, the choice of ReLU(0) in [0, 1] for a neural network has a negligible influence both on backpropagation and training. Yet, in the real world, 32 bits default precision combined with the size of deep learning problems makes it a hyperparameter of training methods. We investigate the importance of the value of...
null
A Contrastive Learning Approach for Training Variational Autoencoder Priors
https://papers.nips.cc/paper_files/paper/2021/hash/0496604c1d80f66fbeb963c12e570a26-Abstract.html
Jyoti Aneja, Alex Schwing, Jan Kautz, Arash Vahdat
https://papers.nips.cc/paper_files/paper/2021/hash/0496604c1d80f66fbeb963c12e570a26-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11660-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0496604c1d80f66fbeb963c12e570a26-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=LcSfRundgwI
https://papers.nips.cc/paper_files/paper/2021/file/0496604c1d80f66fbeb963c12e570a26-Supplemental.pdf
Variational autoencoders (VAEs) are one of the powerful likelihood-based generative models with applications in many domains. However, they struggle to generate high-quality images, especially when samples are obtained from the prior without any tempering. One explanation for VAEs' poor generative quality is the prior ...
null
What training reveals about neural network complexity
https://papers.nips.cc/paper_files/paper/2021/hash/04a1bf2d968f1ce381cf1f9184a807a9-Abstract.html
Andreas Loukas, Marinos Poiitis, Stefanie Jegelka
https://papers.nips.cc/paper_files/paper/2021/hash/04a1bf2d968f1ce381cf1f9184a807a9-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11661-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/04a1bf2d968f1ce381cf1f9184a807a9-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=RcjW7p7z8aJ
null
This work explores the Benevolent Training Hypothesis (BTH) which argues that the complexity of the function a deep neural network (NN) is learning can be deduced by its training dynamics. Our analysis provides evidence for BTH by relating the NN's Lipschitz constant at different regions of the input space with the beh...
null
Class-agnostic Reconstruction of Dynamic Objects from Videos
https://papers.nips.cc/paper_files/paper/2021/hash/04da4aea8e38ac933ab23cb2389dddef-Abstract.html
Zhongzheng Ren, Xiaoming Zhao, Alex Schwing
https://papers.nips.cc/paper_files/paper/2021/hash/04da4aea8e38ac933ab23cb2389dddef-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11662-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/04da4aea8e38ac933ab23cb2389dddef-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=OP6ihHjllEc
null
We introduce REDO, a class-agnostic framework to REconstruct the Dynamic Objects from RGBD or calibrated videos. Compared to prior work, our problem setting is more realistic yet more challenging for three reasons: 1) due to occlusion or camera settings an object of interest may never be entirely visible, but we aim to...
null
Unique sparse decomposition of low rank matrices
https://papers.nips.cc/paper_files/paper/2021/hash/051928341be67dcba03f0e04104d9047-Abstract.html
Dian Jin, Xin Bing, Yuqian Zhang
https://papers.nips.cc/paper_files/paper/2021/hash/051928341be67dcba03f0e04104d9047-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11663-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/051928341be67dcba03f0e04104d9047-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=2GapPLFKvA
https://papers.nips.cc/paper_files/paper/2021/file/051928341be67dcba03f0e04104d9047-Supplemental.pdf
The problem of finding the unique low dimensional decomposition of a given matrix has been a fundamental and recurrent problem in many areas. In this paper, we study the problem of seeking a unique decomposition of a low-rank matrix $Y\in \mathbb{R}^{p\times n}$ that admits a sparse representation. Specifically, we co...
null
Neighborhood Reconstructing Autoencoders
https://papers.nips.cc/paper_files/paper/2021/hash/05311655a15b75fab86956663e1819cd-Abstract.html
Yonghyeon LEE, Hyeokjun Kwon, Frank Park
https://papers.nips.cc/paper_files/paper/2021/hash/05311655a15b75fab86956663e1819cd-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11664-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/05311655a15b75fab86956663e1819cd-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=_kaH2bAI3O
https://papers.nips.cc/paper_files/paper/2021/file/05311655a15b75fab86956663e1819cd-Supplemental.pdf
Vanilla autoencoders often produce manifolds that overfit to noisy training data, or have the wrong local connectivity and geometry. Autoencoder regularization techniques, e.g., the denoising autoencoder, have had some success in reducing overfitting, whereas recent graph-based methods that exploit local connectivity i...
null
TopicNet: Semantic Graph-Guided Topic Discovery
https://papers.nips.cc/paper_files/paper/2021/hash/0537fb40a68c18da59a35c2bfe1ca554-Abstract.html
Zhibin Duan, Yi.shi Xu, Bo Chen, dongsheng wang, Chaojie Wang, Mingyuan Zhou
https://papers.nips.cc/paper_files/paper/2021/hash/0537fb40a68c18da59a35c2bfe1ca554-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11665-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0537fb40a68c18da59a35c2bfe1ca554-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=ZB8Du-E1KUz
https://papers.nips.cc/paper_files/paper/2021/file/0537fb40a68c18da59a35c2bfe1ca554-Supplemental.pdf
Existing deep hierarchical topic models are able to extract semantically meaningful topics from a text corpus in an unsupervised manner and automatically organize them into a topic hierarchy. However, it is unclear how to incorporate prior belief such as knowledge graph to guide the learning of the topic hierarchy. T...
null
(Almost) Free Incentivized Exploration from Decentralized Learning Agents
https://papers.nips.cc/paper_files/paper/2021/hash/054ab897023645cd7ad69525c46992a0-Abstract.html
Chengshuai Shi, Haifeng Xu, Wei Xiong, Cong Shen
https://papers.nips.cc/paper_files/paper/2021/hash/054ab897023645cd7ad69525c46992a0-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11666-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/054ab897023645cd7ad69525c46992a0-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=2lBhfVPYOM
https://papers.nips.cc/paper_files/paper/2021/file/054ab897023645cd7ad69525c46992a0-Supplemental.pdf
Incentivized exploration in multi-armed bandits (MAB) has witnessed increasing interests and many progresses in recent years, where a principal offers bonuses to agents to do explorations on her behalf. However, almost all existing studies are confined to temporary myopic agents. In this work, we break this barrier and...
null
Combining Recurrent, Convolutional, and Continuous-time Models with Linear State Space Layers
https://papers.nips.cc/paper_files/paper/2021/hash/05546b0e38ab9175cd905eebcc6ebb76-Abstract.html
Albert Gu, Isys Johnson, Karan Goel, Khaled Saab, Tri Dao, Atri Rudra, Christopher Ré
https://papers.nips.cc/paper_files/paper/2021/hash/05546b0e38ab9175cd905eebcc6ebb76-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11667-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/05546b0e38ab9175cd905eebcc6ebb76-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=yWd42CWN3c
https://papers.nips.cc/paper_files/paper/2021/file/05546b0e38ab9175cd905eebcc6ebb76-Supplemental.pdf
Recurrent neural networks (RNNs), temporal convolutions, and neural differential equations (NDEs) are popular families of deep learning models for time-series data, each with unique strengths and tradeoffs in modeling power and computational efficiency. We introduce a simple sequence model inspired by control systems ...
null
Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustness
https://papers.nips.cc/paper_files/paper/2021/hash/055e31fa43e652cb4ab6c0ee845c8d36-Abstract.html
Zifeng Wang, Tong Jian, Aria Masoomi, Stratis Ioannidis, Jennifer Dy
https://papers.nips.cc/paper_files/paper/2021/hash/055e31fa43e652cb4ab6c0ee845c8d36-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11668-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/055e31fa43e652cb4ab6c0ee845c8d36-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=OThHxQUDzkp
https://papers.nips.cc/paper_files/paper/2021/file/055e31fa43e652cb4ab6c0ee845c8d36-Supplemental.pdf
We investigate the HSIC (Hilbert-Schmidt independence criterion) bottleneck as a regularizer for learning an adversarially robust deep neural network classifier. In addition to the usual cross-entropy loss, we add regularization terms for every intermediate layer to ensure that the latent representations retain useful ...
null
T-LoHo: A Bayesian Regularization Model for Structured Sparsity and Smoothness on Graphs
https://papers.nips.cc/paper_files/paper/2021/hash/05a70454516ecd9194c293b0e415777f-Abstract.html
Changwoo Lee, Zhao Tang Luo, Huiyan Sang
https://papers.nips.cc/paper_files/paper/2021/hash/05a70454516ecd9194c293b0e415777f-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11669-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/05a70454516ecd9194c293b0e415777f-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=Kvef55YMkm3
https://papers.nips.cc/paper_files/paper/2021/file/05a70454516ecd9194c293b0e415777f-Supplemental.pdf
Graphs have been commonly used to represent complex data structures. In models dealing with graph-structured data, multivariate parameters may not only exhibit sparse patterns but have structured sparsity and smoothness in the sense that both zero and non-zero parameters tend to cluster together. We propose a new prior...
null
The Utility of Explainable AI in Ad Hoc Human-Machine Teaming
https://papers.nips.cc/paper_files/paper/2021/hash/05d74c48b5b30514d8e9bd60320fc8f6-Abstract.html
Rohan Paleja, Muyleng Ghuy, Nadun Ranawaka Arachchige, Reed Jensen, Matthew Gombolay
https://papers.nips.cc/paper_files/paper/2021/hash/05d74c48b5b30514d8e9bd60320fc8f6-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11670-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/05d74c48b5b30514d8e9bd60320fc8f6-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=w6U6g5Bvug
https://papers.nips.cc/paper_files/paper/2021/file/05d74c48b5b30514d8e9bd60320fc8f6-Supplemental.pdf
Recent advances in machine learning have led to growing interest in Explainable AI (xAI) to enable humans to gain insight into the decision-making of machine learning models. Despite this recent interest, the utility of xAI techniques has not yet been characterized in human-machine teaming. Importantly, xAI offers the ...
null
Subgoal Search For Complex Reasoning Tasks
https://papers.nips.cc/paper_files/paper/2021/hash/05d8cccb5f47e5072f0a05b5f514941a-Abstract.html
Konrad Czechowski, Tomasz Odrzygóźdź, Marek Zbysiński, Michał Zawalski, Krzysztof Olejnik, Yuhuai Wu, Łukasz Kuciński, Piotr Miłoś
https://papers.nips.cc/paper_files/paper/2021/hash/05d8cccb5f47e5072f0a05b5f514941a-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11671-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/05d8cccb5f47e5072f0a05b5f514941a-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=5KCvuCYGi7G
https://papers.nips.cc/paper_files/paper/2021/file/05d8cccb5f47e5072f0a05b5f514941a-Supplemental.pdf
Humans excel in solving complex reasoning tasks through a mental process of moving from one idea to a related one. Inspired by this, we propose Subgoal Search (kSubS) method. Its key component is a learned subgoal generator that produces a diversity of subgoals that are both achievable and closer to the solution. Using...
null
MCMC Variational Inference via Uncorrected Hamiltonian Annealing
https://papers.nips.cc/paper_files/paper/2021/hash/05f971b5ec196b8c65b75d2ef8267331-Abstract.html
Tomas Geffner, Justin Domke
https://papers.nips.cc/paper_files/paper/2021/hash/05f971b5ec196b8c65b75d2ef8267331-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11672-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/05f971b5ec196b8c65b75d2ef8267331-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=YsZQhCJunjl
https://papers.nips.cc/paper_files/paper/2021/file/05f971b5ec196b8c65b75d2ef8267331-Supplemental.pdf
Given an unnormalized target distribution we want to obtain approximate samples from it and a tight lower bound on its (log) normalization constant log Z. Annealed Importance Sampling (AIS) with Hamiltonian MCMC is a powerful method that can be used to do this. Its main drawback is that it uses non-differentiable trans...
null
Landmark-RxR: Solving Vision-and-Language Navigation with Fine-Grained Alignment Supervision
https://papers.nips.cc/paper_files/paper/2021/hash/0602940f23884f782058efac46f64b0f-Abstract.html
Keji He, Yan Huang, Qi Wu, Jianhua Yang, Dong An, Shuanglin Sima, Liang Wang
https://papers.nips.cc/paper_files/paper/2021/hash/0602940f23884f782058efac46f64b0f-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11673-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0602940f23884f782058efac46f64b0f-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=41QJ--DLjoD
https://papers.nips.cc/paper_files/paper/2021/file/0602940f23884f782058efac46f64b0f-Supplemental.pdf
In Vision-and-Language Navigation (VLN) task, an agent is asked to navigate inside 3D indoor environments following given instructions. Cross-modal alignment is one of the most critical challenges in VLN because the predicted trajectory needs to match the given instruction accurately. In this paper, we address the cros...
null
A Winning Hand: Compressing Deep Networks Can Improve Out-of-Distribution Robustness
https://papers.nips.cc/paper_files/paper/2021/hash/0607f4c705595b911a4f3e7a127b44e0-Abstract.html
James Diffenderfer, Brian Bartoldson, Shreya Chaganti, Jize Zhang, Bhavya Kailkhura
https://papers.nips.cc/paper_files/paper/2021/hash/0607f4c705595b911a4f3e7a127b44e0-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11674-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0607f4c705595b911a4f3e7a127b44e0-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=YygA0yppTR
https://papers.nips.cc/paper_files/paper/2021/file/0607f4c705595b911a4f3e7a127b44e0-Supplemental.pdf
Successful adoption of deep learning (DL) in the wild requires models to be: (1) compact, (2) accurate, and (3) robust to distributional shifts. Unfortunately, efforts towards simultaneously meeting these requirements have mostly been unsuccessful. This raises an important question: Is the inability to create Compact, ...
null
On the Importance of Gradients for Detecting Distributional Shifts in the Wild
https://papers.nips.cc/paper_files/paper/2021/hash/063e26c670d07bb7c4d30e6fc69fe056-Abstract.html
Rui Huang, Andrew Geng, Yixuan Li
https://papers.nips.cc/paper_files/paper/2021/hash/063e26c670d07bb7c4d30e6fc69fe056-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11675-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/063e26c670d07bb7c4d30e6fc69fe056-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=fmiwLdJCmLS
https://papers.nips.cc/paper_files/paper/2021/file/063e26c670d07bb7c4d30e6fc69fe056-Supplemental.pdf
Detecting out-of-distribution (OOD) data has become a critical component in ensuring the safe deployment of machine learning models in the real world. Existing OOD detection approaches primarily rely on the output or feature space for deriving OOD scores, while largely overlooking information from the gradient space. I...
null
Iterative Methods for Private Synthetic Data: Unifying Framework and New Methods
https://papers.nips.cc/paper_files/paper/2021/hash/0678c572b0d5597d2d4a6b5bd135754c-Abstract.html
Terrance Liu, Giuseppe Vietri, Steven Z. Wu
https://papers.nips.cc/paper_files/paper/2021/hash/0678c572b0d5597d2d4a6b5bd135754c-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11676-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0678c572b0d5597d2d4a6b5bd135754c-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=jcCatp6oWZK
https://papers.nips.cc/paper_files/paper/2021/file/0678c572b0d5597d2d4a6b5bd135754c-Supplemental.pdf
We study private synthetic data generation for query release, where the goal is to construct a sanitized version of a sensitive dataset, subject to differential privacy, that approximately preserves the answers to a large collection of statistical queries. We first present an algorithmic framework that unifies a long l...
null
Understanding End-to-End Model-Based Reinforcement Learning Methods as Implicit Parameterization
https://papers.nips.cc/paper_files/paper/2021/hash/067a26d87265ea39030f5bd82408ce7c-Abstract.html
Clement Gehring, Kenji Kawaguchi, Jiaoyang Huang, Leslie Kaelbling
https://papers.nips.cc/paper_files/paper/2021/hash/067a26d87265ea39030f5bd82408ce7c-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11677-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/067a26d87265ea39030f5bd82408ce7c-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=xj2sE--Q90e
https://papers.nips.cc/paper_files/paper/2021/file/067a26d87265ea39030f5bd82408ce7c-Supplemental.pdf
Estimating the per-state expected cumulative rewards is a critical aspect of reinforcement learning approaches, however the experience is obtained, but standard deep neural-network function-approximation methods are often inefficient in this setting. An alternative approach, exemplified by value iteration networks, is ...
null
Mirror Langevin Monte Carlo: the Case Under Isoperimetry
https://papers.nips.cc/paper_files/paper/2021/hash/069090145d54bf4aa3894133f7e89873-Abstract.html
Qijia Jiang
https://papers.nips.cc/paper_files/paper/2021/hash/069090145d54bf4aa3894133f7e89873-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11678-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/069090145d54bf4aa3894133f7e89873-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=9In970xfmNk
https://papers.nips.cc/paper_files/paper/2021/file/069090145d54bf4aa3894133f7e89873-Supplemental.pdf
Motivated by the connection between sampling and optimization, we study a mirror descent analogue of Langevin dynamics and analyze three different discretization schemes, giving nonasymptotic convergence rate under functional inequalities such as Log-Sobolev in the corresponding metric. Compared to the Euclidean settin...
null
Do Different Tracking Tasks Require Different Appearance Models?
https://papers.nips.cc/paper_files/paper/2021/hash/06997f04a7db92466a2baa6ebc8b872d-Abstract.html
Zhongdao Wang, Hengshuang Zhao, Ya-Li Li, Shengjin Wang, Philip Torr, Luca Bertinetto
https://papers.nips.cc/paper_files/paper/2021/hash/06997f04a7db92466a2baa6ebc8b872d-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11679-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/06997f04a7db92466a2baa6ebc8b872d-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=HShLSEcVZJ4
https://papers.nips.cc/paper_files/paper/2021/file/06997f04a7db92466a2baa6ebc8b872d-Supplemental.pdf
Tracking objects of interest in a video is one of the most popular and widely applicable problems in computer vision. However, with the years, a Cambrian explosion of use cases and benchmarks has fragmented the problem in a multitude of different experimental setups. As a consequence, the literature has fragmented too,...
null
Towards robust vision by multi-task learning on monkey visual cortex
https://papers.nips.cc/paper_files/paper/2021/hash/06a9d51e04213572ef0720dd27a84792-Abstract.html
Shahd Safarani, Arne Nix, Konstantin Willeke, Santiago Cadena, Kelli Restivo, George Denfield, Andreas Tolias, Fabian Sinz
https://papers.nips.cc/paper_files/paper/2021/hash/06a9d51e04213572ef0720dd27a84792-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11680-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/06a9d51e04213572ef0720dd27a84792-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=3KhhJxaufVF
https://papers.nips.cc/paper_files/paper/2021/file/06a9d51e04213572ef0720dd27a84792-Supplemental.pdf
Deep neural networks set the state-of-the-art across many tasks in computer vision, but their generalization ability to simple image distortions is surprisingly fragile. In contrast, the mammalian visual system is robust to a wide range of perturbations. Recent work suggests that this generalization ability can be expl...
null
Arbitrary Conditional Distributions with Energy
https://papers.nips.cc/paper_files/paper/2021/hash/06c284d3f757b15c02f47f3ff06dc275-Abstract.html
Ryan Strauss, Junier B. Oliva
https://papers.nips.cc/paper_files/paper/2021/hash/06c284d3f757b15c02f47f3ff06dc275-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11681-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/06c284d3f757b15c02f47f3ff06dc275-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=_idcJrecij
null
Modeling distributions of covariates, or density estimation, is a core challenge in unsupervised learning. However, the majority of work only considers the joint distribution, which has limited relevance to practical situations. A more general and useful problem is arbitrary conditional density estimation, which aims t...
null
Learning Domain Invariant Representations in Goal-conditioned Block MDPs
https://papers.nips.cc/paper_files/paper/2021/hash/06d172404821f7d01060cc9629171b2e-Abstract.html
Beining Han, Chongyi Zheng, Harris Chan, Keiran Paster, Michael Zhang, Jimmy Ba
https://papers.nips.cc/paper_files/paper/2021/hash/06d172404821f7d01060cc9629171b2e-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11682-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/06d172404821f7d01060cc9629171b2e-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=oepSB9bsoCF
https://papers.nips.cc/paper_files/paper/2021/file/06d172404821f7d01060cc9629171b2e-Supplemental.pdf
Deep Reinforcement Learning (RL) is successful in solving many complex Markov Decision Processes (MDPs) problems. However, agents often face unanticipated environmental changes after deployment in the real world. These changes are often spurious and unrelated to the underlying problem, such as background shifts for vis...
null
Near-Optimal Multi-Perturbation Experimental Design for Causal Structure Learning
https://papers.nips.cc/paper_files/paper/2021/hash/06d5ae105ea1bea4d800bc96491876e9-Abstract.html
Scott Sussex, Caroline Uhler, Andreas Krause
https://papers.nips.cc/paper_files/paper/2021/hash/06d5ae105ea1bea4d800bc96491876e9-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11683-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/06d5ae105ea1bea4d800bc96491876e9-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=mbm8YOsoSER
https://papers.nips.cc/paper_files/paper/2021/file/06d5ae105ea1bea4d800bc96491876e9-Supplemental.pdf
Causal structure learning is a key problem in many domains. Causal structures can be learnt by performing experiments on the system of interest. We address the largely unexplored problem of designing a batch of experiments that each simultaneously intervene on multiple variables. While potentially more informative than...
null
Fuzzy Clustering with Similarity Queries
https://papers.nips.cc/paper_files/paper/2021/hash/06f2e099b4f87109d52e15d7c05f0084-Abstract.html
Wasim Huleihel, Arya Mazumdar, Soumyabrata Pal
https://papers.nips.cc/paper_files/paper/2021/hash/06f2e099b4f87109d52e15d7c05f0084-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11684-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/06f2e099b4f87109d52e15d7c05f0084-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=slvWAZohje
https://papers.nips.cc/paper_files/paper/2021/file/06f2e099b4f87109d52e15d7c05f0084-Supplemental.pdf
The fuzzy or soft $k$-means objective is a popular generalization of the well-known $k$-means problem, extending the clustering capability of the $k$-means to datasets that are uncertain, vague and otherwise hard to cluster. In this paper, we propose a semi-supervised active clustering framework, where the learner is a...
null
Improving black-box optimization in VAE latent space using decoder uncertainty
https://papers.nips.cc/paper_files/paper/2021/hash/06fe1c234519f6812fc4c1baae25d6af-Abstract.html
Pascal Notin, José Miguel Hernández-Lobato, Yarin Gal
https://papers.nips.cc/paper_files/paper/2021/hash/06fe1c234519f6812fc4c1baae25d6af-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11685-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/06fe1c234519f6812fc4c1baae25d6af-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=F7LYy9FnK2x
https://papers.nips.cc/paper_files/paper/2021/file/06fe1c234519f6812fc4c1baae25d6af-Supplemental.pdf
Optimization in the latent space of variational autoencoders is a promising approach to generate high-dimensional discrete objects that maximize an expensive black-box property (e.g., drug-likeness in molecular generation, function approximation with arithmetic expressions). However, existing methods lack robustness as...
null
Sample Selection for Fair and Robust Training
https://papers.nips.cc/paper_files/paper/2021/hash/07563a3fe3bbe7e3ba84431ad9d055af-Abstract.html
Yuji Roh, Kangwook Lee, Steven Whang, Changho Suh
https://papers.nips.cc/paper_files/paper/2021/hash/07563a3fe3bbe7e3ba84431ad9d055af-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11686-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07563a3fe3bbe7e3ba84431ad9d055af-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=IZNR0RDtGp3
null
Fairness and robustness are critical elements of Trustworthy AI that need to be addressed together. Fairness is about learning an unbiased model while robustness is about learning from corrupted data, and it is known that addressing only one of them may have an adverse affect on the other. In this work, we propose a sa...
null
NeurWIN: Neural Whittle Index Network For Restless Bandits Via Deep RL
https://papers.nips.cc/paper_files/paper/2021/hash/0768281a05da9f27df178b5c39a51263-Abstract.html
Khaled Nakhleh, Santosh Ganji, Ping-Chun Hsieh, I-Hong Hou, Srinivas Shakkottai
https://papers.nips.cc/paper_files/paper/2021/hash/0768281a05da9f27df178b5c39a51263-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11687-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0768281a05da9f27df178b5c39a51263-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=5sCVR3Lq6F
https://papers.nips.cc/paper_files/paper/2021/file/0768281a05da9f27df178b5c39a51263-Supplemental.zip
Whittle index policy is a powerful tool to obtain asymptotically optimal solutions for the notoriously intractable problem of restless bandits. However, finding the Whittle indices remains a difficult problem for many practical restless bandits with convoluted transition kernels. This paper proposes NeurWIN, a neural W...
null
Sageflow: Robust Federated Learning against Both Stragglers and Adversaries
https://papers.nips.cc/paper_files/paper/2021/hash/076a8133735eb5d7552dc195b125a454-Abstract.html
Jungwuk Park, Dong-Jun Han, Minseok Choi, Jaekyun Moon
https://papers.nips.cc/paper_files/paper/2021/hash/076a8133735eb5d7552dc195b125a454-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11688-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/076a8133735eb5d7552dc195b125a454-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=rA9HFxFT7th
https://papers.nips.cc/paper_files/paper/2021/file/076a8133735eb5d7552dc195b125a454-Supplemental.pdf
While federated learning (FL) allows efficient model training with local data at edge devices, among major issues still to be resolved are: slow devices known as stragglers and malicious attacks launched by adversaries. While the presence of both of these issues raises serious concerns in practical FL systems, no kno...
null
Alias-Free Generative Adversarial Networks
https://papers.nips.cc/paper_files/paper/2021/hash/076ccd93ad68be51f23707988e934906-Abstract.html
Tero Karras, Miika Aittala, Samuli Laine, Erik Härkönen, Janne Hellsten, Jaakko Lehtinen, Timo Aila
https://papers.nips.cc/paper_files/paper/2021/hash/076ccd93ad68be51f23707988e934906-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11689-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/076ccd93ad68be51f23707988e934906-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=Owggnutk6lE
https://papers.nips.cc/paper_files/paper/2021/file/076ccd93ad68be51f23707988e934906-Supplemental.pdf
We observe that despite their hierarchical convolutional nature, the synthesis process of typical generative adversarial networks depends on absolute pixel coordinates in an unhealthy manner. This manifests itself as, e.g., detail appearing to be glued to image coordinates instead of the surfaces of depicted objects. W...
null
Noise2Score: Tweedie’s Approach to Self-Supervised Image Denoising without Clean Images
https://papers.nips.cc/paper_files/paper/2021/hash/077b83af57538aa183971a2fe0971ec1-Abstract.html
Kwanyoung Kim, Jong Chul Ye
https://papers.nips.cc/paper_files/paper/2021/hash/077b83af57538aa183971a2fe0971ec1-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11690-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/077b83af57538aa183971a2fe0971ec1-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=ZqEUs3sTRU0
https://papers.nips.cc/paper_files/paper/2021/file/077b83af57538aa183971a2fe0971ec1-Supplemental.pdf
Recently, there has been extensive research interest in training deep networks to denoise images without clean reference.However, the representative approaches such as Noise2Noise, Noise2Void, Stein's unbiased risk estimator (SURE), etc. seem to differ from one another and it is difficult to find the coherent mathem...
null
Continuous Mean-Covariance Bandits
https://papers.nips.cc/paper_files/paper/2021/hash/07811dc6c422334ce36a09ff5cd6fe71-Abstract.html
Yihan Du, Siwei Wang, Zhixuan Fang, Longbo Huang
https://papers.nips.cc/paper_files/paper/2021/hash/07811dc6c422334ce36a09ff5cd6fe71-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11691-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07811dc6c422334ce36a09ff5cd6fe71-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=pbAmqUUHsQ
https://papers.nips.cc/paper_files/paper/2021/file/07811dc6c422334ce36a09ff5cd6fe71-Supplemental.pdf
Existing risk-aware multi-armed bandit models typically focus on risk measures of individual options such as variance. As a result, they cannot be directly applied to important real-world online decision making problems with correlated options. In this paper, we propose a novel Continuous Mean-Covariance Bandit (CMCB) ...
null
Dynamic Visual Reasoning by Learning Differentiable Physics Models from Video and Language
https://papers.nips.cc/paper_files/paper/2021/hash/07845cd9aefa6cde3f8926d25138a3a2-Abstract.html
Mingyu Ding, Zhenfang Chen, Tao Du, Ping Luo, Josh Tenenbaum, Chuang Gan
https://papers.nips.cc/paper_files/paper/2021/hash/07845cd9aefa6cde3f8926d25138a3a2-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11692-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07845cd9aefa6cde3f8926d25138a3a2-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=lk1ORT35tbi
https://papers.nips.cc/paper_files/paper/2021/file/07845cd9aefa6cde3f8926d25138a3a2-Supplemental.pdf
In this work, we propose a unified framework, called Visual Reasoning with Differ-entiable Physics (VRDP), that can jointly learn visual concepts and infer physics models of objects and their interactions from videos and language. This is achieved by seamlessly integrating three components: a visual perception module, ...
null
Solving Soft Clustering Ensemble via $k$-Sparse Discrete Wasserstein Barycenter
https://papers.nips.cc/paper_files/paper/2021/hash/07a4e20a7bbeeb7a736682b26b16ebe8-Abstract.html
Ruizhe Qin, Mengying Li, Hu Ding
https://papers.nips.cc/paper_files/paper/2021/hash/07a4e20a7bbeeb7a736682b26b16ebe8-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11693-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07a4e20a7bbeeb7a736682b26b16ebe8-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=yAIYc7YjGbd
null
Clustering ensemble is one of the most important problems in ensemble learning. Though it has been extensively studied in the past decades, the existing methods often suffer from the issues like high computational complexity and the difficulty on understanding the consensus. In this paper, we study the more general so...
null
Bayesian Adaptation for Covariate Shift
https://papers.nips.cc/paper_files/paper/2021/hash/07ac7cd13fd0eb1654ccdbd222b81437-Abstract.html
Aurick Zhou, Sergey Levine
https://papers.nips.cc/paper_files/paper/2021/hash/07ac7cd13fd0eb1654ccdbd222b81437-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11694-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07ac7cd13fd0eb1654ccdbd222b81437-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=15HPeY8MGQ
https://papers.nips.cc/paper_files/paper/2021/file/07ac7cd13fd0eb1654ccdbd222b81437-Supplemental.zip
When faced with distribution shift at test time, deep neural networks often make inaccurate predictions with unreliable uncertainty estimates.While improving the robustness of neural networks is one promising approach to mitigate this issue, an appealing alternate to robustifying networks against all possible test-time...
null
Perturb-and-max-product: Sampling and learning in discrete energy-based models
https://papers.nips.cc/paper_files/paper/2021/hash/07b1c04a30f798b5506c1ec5acfb9031-Abstract.html
Miguel Lazaro-Gredilla, Antoine Dedieu, Dileep George
https://papers.nips.cc/paper_files/paper/2021/hash/07b1c04a30f798b5506c1ec5acfb9031-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11695-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07b1c04a30f798b5506c1ec5acfb9031-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=xRJ_Xqmb6d
https://papers.nips.cc/paper_files/paper/2021/file/07b1c04a30f798b5506c1ec5acfb9031-Supplemental.pdf
Perturb-and-MAP offers an elegant approach to approximately sample from a energy-based model (EBM) by computing the maximum-a-posteriori (MAP) configuration of a perturbed version of the model. Sampling in turn enables learning. However, this line of research has been hindered by the general intractability of the MAP c...
null
Towards Unifying Behavioral and Response Diversity for Open-ended Learning in Zero-sum Games
https://papers.nips.cc/paper_files/paper/2021/hash/07bba581a2dd8d098a3be0f683560643-Abstract.html
Xiangyu Liu, Hangtian Jia, Ying Wen, Yujing Hu, Yingfeng Chen, Changjie Fan, ZHIPENG HU, Yaodong Yang
https://papers.nips.cc/paper_files/paper/2021/hash/07bba581a2dd8d098a3be0f683560643-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11696-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07bba581a2dd8d098a3be0f683560643-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=G_WdNNLj4wU
https://papers.nips.cc/paper_files/paper/2021/file/07bba581a2dd8d098a3be0f683560643-Supplemental.pdf
Measuring and promoting policy diversity is critical for solving games with strong non-transitive dynamics where strategic cycles exist, and there is no consistent winner (e.g., Rock-Paper-Scissors). With that in mind, maintaining a pool of diverse policies via open-ended learning is an attractive solution, which can g...
null
Towards Better Understanding of Training Certifiably Robust Models against Adversarial Examples
https://papers.nips.cc/paper_files/paper/2021/hash/07c5807d0d927dcd0980f86024e5208b-Abstract.html
Sungyoon Lee, Woojin Lee, Jinseong Park, Jaewook Lee
https://papers.nips.cc/paper_files/paper/2021/hash/07c5807d0d927dcd0980f86024e5208b-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11697-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07c5807d0d927dcd0980f86024e5208b-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=52weXyh2yh
null
We study the problem of training certifiably robust models against adversarial examples. Certifiable training minimizes an upper bound on the worst-case loss over the allowed perturbation, and thus the tightness of the upper bound is an important factor in building certifiably robust models. However, many studies have ...
null
Mitigating Covariate Shift in Imitation Learning via Offline Data With Partial Coverage
https://papers.nips.cc/paper_files/paper/2021/hash/07d5938693cc3903b261e1a3844590ed-Abstract.html
Jonathan Chang, Masatoshi Uehara, Dhruv Sreenivas, Rahul Kidambi, Wen Sun
https://papers.nips.cc/paper_files/paper/2021/hash/07d5938693cc3903b261e1a3844590ed-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11698-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07d5938693cc3903b261e1a3844590ed-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=7PkfLkyLMRM
https://papers.nips.cc/paper_files/paper/2021/file/07d5938693cc3903b261e1a3844590ed-Supplemental.pdf
This paper studies offline Imitation Learning (IL) where an agent learns to imitate an expert demonstrator without additional online environment interactions. Instead, the learner is presented with a static offline dataset of state-action-next state triples from a potentially less proficient behavior policy. We introdu...
null
Global Filter Networks for Image Classification
https://papers.nips.cc/paper_files/paper/2021/hash/07e87c2f4fc7f7c96116d8e2a92790f5-Abstract.html
Yongming Rao, Wenliang Zhao, Zheng Zhu, Jiwen Lu, Jie Zhou
https://papers.nips.cc/paper_files/paper/2021/hash/07e87c2f4fc7f7c96116d8e2a92790f5-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11699-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/07e87c2f4fc7f7c96116d8e2a92790f5-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=K_Mnsw5VoOW
https://papers.nips.cc/paper_files/paper/2021/file/07e87c2f4fc7f7c96116d8e2a92790f5-Supplemental.pdf
Recent advances in self-attention and pure multi-layer perceptrons (MLP) models for vision have shown great potential in achieving promising performance with fewer inductive biases. These models are generally based on learning interaction among spatial locations from raw data. The complexity of self-attention and MLP g...
null
CAFE: Catastrophic Data Leakage in Vertical Federated Learning
https://papers.nips.cc/paper_files/paper/2021/hash/08040837089cdf46631a10aca5258e16-Abstract.html
Xiao Jin, Pin-Yu Chen, Chia-Yi Hsu, Chia-Mu Yu, Tianyi Chen
https://papers.nips.cc/paper_files/paper/2021/hash/08040837089cdf46631a10aca5258e16-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11700-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08040837089cdf46631a10aca5258e16-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=b4YiFnQH3gN
https://papers.nips.cc/paper_files/paper/2021/file/08040837089cdf46631a10aca5258e16-Supplemental.zip
Recent studies show that private training data can be leaked through the gradients sharing mechanism deployed in distributed machine learning systems, such as federated learning (FL). Increasing batch size to complicate data recovery is often viewed as a promising defense strategy against data leakage. In this paper, w...
null
Fault-Tolerant Federated Reinforcement Learning with Theoretical Guarantee
https://papers.nips.cc/paper_files/paper/2021/hash/080acdcce72c06873a773c4311c2e464-Abstract.html
Xiaofeng Fan, Yining Ma, Zhongxiang Dai, Wei Jing, Cheston Tan, Bryan Kian Hsiang Low
https://papers.nips.cc/paper_files/paper/2021/hash/080acdcce72c06873a773c4311c2e464-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11701-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/080acdcce72c06873a773c4311c2e464-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=ospGnpuf6L
https://papers.nips.cc/paper_files/paper/2021/file/080acdcce72c06873a773c4311c2e464-Supplemental.pdf
The growing literature of Federated Learning (FL) has recently inspired Federated Reinforcement Learning (FRL) to encourage multiple agents to federatively build a better decision-making policy without sharing raw trajectories. Despite its promising applications, existing works on FRL fail to I) provide theoretical ana...
null
Compacter: Efficient Low-Rank Hypercomplex Adapter Layers
https://papers.nips.cc/paper_files/paper/2021/hash/081be9fdff07f3bc808f935906ef70c0-Abstract.html
Rabeeh Karimi Mahabadi, James Henderson, Sebastian Ruder
https://papers.nips.cc/paper_files/paper/2021/hash/081be9fdff07f3bc808f935906ef70c0-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11702-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/081be9fdff07f3bc808f935906ef70c0-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=bqGK5PyI6-N
https://papers.nips.cc/paper_files/paper/2021/file/081be9fdff07f3bc808f935906ef70c0-Supplemental.pdf
Adapting large-scale pretrained language models to downstream tasks via fine-tuning is the standard method for achieving state-of-the-art performance on NLP benchmarks. However, fine-tuning all weights of models with millions or billions of parameters is sample-inefficient, unstable in low-resource settings, and wastef...
null
Distilling Image Classifiers in Object Detectors
https://papers.nips.cc/paper_files/paper/2021/hash/082a8bbf2c357c09f26675f9cf5bcba3-Abstract.html
Shuxuan Guo, Jose M. Alvarez, Mathieu Salzmann
https://papers.nips.cc/paper_files/paper/2021/hash/082a8bbf2c357c09f26675f9cf5bcba3-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11703-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/082a8bbf2c357c09f26675f9cf5bcba3-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=tCYjE8Pf2Zg
https://papers.nips.cc/paper_files/paper/2021/file/082a8bbf2c357c09f26675f9cf5bcba3-Supplemental.pdf
Knowledge distillation constitutes a simple yet effective way to improve the performance of a compact student network by exploiting the knowledge of a more powerful teacher. Nevertheless, the knowledge distillation literature remains limited to the scenario where the student and the teacher tackle the same task. Here, ...
null
Subgroup Generalization and Fairness of Graph Neural Networks
https://papers.nips.cc/paper_files/paper/2021/hash/08425b881bcde94a383cd258cea331be-Abstract.html
Jiaqi Ma, Junwei Deng, Qiaozhu Mei
https://papers.nips.cc/paper_files/paper/2021/hash/08425b881bcde94a383cd258cea331be-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11704-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08425b881bcde94a383cd258cea331be-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=68B1ezcffDc
https://papers.nips.cc/paper_files/paper/2021/file/08425b881bcde94a383cd258cea331be-Supplemental.pdf
Despite enormous successful applications of graph neural networks (GNNs), theoretical understanding of their generalization ability, especially for node-level tasks where data are not independent and identically-distributed (IID), has been sparse. The theoretical investigation of the generalization performance is benef...
null
Scaling Neural Tangent Kernels via Sketching and Random Features
https://papers.nips.cc/paper_files/paper/2021/hash/08ae6a26b7cb089ea588e94aed36bd15-Abstract.html
Amir Zandieh, Insu Han, Haim Avron, Neta Shoham, Chaewon Kim, Jinwoo Shin
https://papers.nips.cc/paper_files/paper/2021/hash/08ae6a26b7cb089ea588e94aed36bd15-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11705-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08ae6a26b7cb089ea588e94aed36bd15-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=vIRFiA658rh
https://papers.nips.cc/paper_files/paper/2021/file/08ae6a26b7cb089ea588e94aed36bd15-Supplemental.zip
The Neural Tangent Kernel (NTK) characterizes the behavior of infinitely-wide neural networks trained under least squares loss by gradient descent. Recent works also report that NTK regression can outperform finitely-wide neural networks trained on small-scale datasets. However, the computational complexity of kernel m...
null
BatchQuant: Quantized-for-all Architecture Search with Robust Quantizer
https://papers.nips.cc/paper_files/paper/2021/hash/08aee6276db142f4b8ac98fb8ee0ed1b-Abstract.html
Haoping Bai, Meng Cao, Ping Huang, Jiulong Shan
https://papers.nips.cc/paper_files/paper/2021/hash/08aee6276db142f4b8ac98fb8ee0ed1b-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11706-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08aee6276db142f4b8ac98fb8ee0ed1b-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=qQAtFdyDr-
null
As the applications of deep learning models on edge devices increase at an accelerating pace, fast adaptation to various scenarios with varying resource constraints has become a crucial aspect of model deployment. As a result, model optimization strategies with adaptive configuration are becoming increasingly popular. ...
null
Long Short-Term Transformer for Online Action Detection
https://papers.nips.cc/paper_files/paper/2021/hash/08b255a5d42b89b0585260b6f2360bdd-Abstract.html
Mingze Xu, Yuanjun Xiong, Hao Chen, Xinyu Li, Wei Xia, Zhuowen Tu, Stefano Soatto
https://papers.nips.cc/paper_files/paper/2021/hash/08b255a5d42b89b0585260b6f2360bdd-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11707-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08b255a5d42b89b0585260b6f2360bdd-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=aohkNJxjYJX
https://papers.nips.cc/paper_files/paper/2021/file/08b255a5d42b89b0585260b6f2360bdd-Supplemental.pdf
We present Long Short-term TRansformer (LSTR), a temporal modeling algorithm for online action detection, which employs a long- and short-term memory mechanism to model prolonged sequence data. It consists of an LSTR encoder that dynamically leverages coarse-scale historical information from an extended temporal window...
null
Near Optimal Policy Optimization via REPS
https://papers.nips.cc/paper_files/paper/2021/hash/08d562c1eedd30b15b51e35d8486d14c-Abstract.html
Aldo Pacchiano, Jonathan N Lee, Peter Bartlett, Ofir Nachum
https://papers.nips.cc/paper_files/paper/2021/hash/08d562c1eedd30b15b51e35d8486d14c-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11708-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08d562c1eedd30b15b51e35d8486d14c-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=ZEhDWKLTvt7
https://papers.nips.cc/paper_files/paper/2021/file/08d562c1eedd30b15b51e35d8486d14c-Supplemental.pdf
Since its introduction a decade ago, relative entropy policy search (REPS) has demonstrated successful policy learning on a number of simulated and real-world robotic domains, not to mention providing algorithmic components used by many recently proposed reinforcement learning (RL) algorithms. While REPS is commonly kn...
null
Self-Consistent Models and Values
https://papers.nips.cc/paper_files/paper/2021/hash/08f0efebb1c51aada9430a089a2050cc-Abstract.html
Greg Farquhar, Kate Baumli, Zita Marinho, Angelos Filos, Matteo Hessel, Hado P. van Hasselt, David Silver
https://papers.nips.cc/paper_files/paper/2021/hash/08f0efebb1c51aada9430a089a2050cc-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11709-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08f0efebb1c51aada9430a089a2050cc-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=x2rdRAx3QF
https://papers.nips.cc/paper_files/paper/2021/file/08f0efebb1c51aada9430a089a2050cc-Supplemental.pdf
Learned models of the environment provide reinforcement learning (RL) agents with flexible ways of making predictions about the environment.Models enable planning, i.e. using more computation to improve value functions or policies, without requiring additional environment interactions.In this work, we investigate a way...
null
Learning on Random Balls is Sufficient for Estimating (Some) Graph Parameters
https://papers.nips.cc/paper_files/paper/2021/hash/08f36fcf88c0a84c19a6ed437b9cbcc9-Abstract.html
Takanori Maehara, Hoang NT
https://papers.nips.cc/paper_files/paper/2021/hash/08f36fcf88c0a84c19a6ed437b9cbcc9-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11710-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08f36fcf88c0a84c19a6ed437b9cbcc9-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=Tbq5fYViJzm
https://papers.nips.cc/paper_files/paper/2021/file/08f36fcf88c0a84c19a6ed437b9cbcc9-Supplemental.pdf
Theoretical analyses for graph learning methods often assume a complete observation of the input graph. Such an assumption might not be useful for handling any-size graphs due to the scalability issues in practice. In this work, we develop a theoretical framework for graph classification problems in the partial observa...
null
Risk-Averse Bayes-Adaptive Reinforcement Learning
https://papers.nips.cc/paper_files/paper/2021/hash/08f90c1a417155361a5c4b8d297e0d78-Abstract.html
Marc Rigter, Bruno Lacerda, Nick Hawes
https://papers.nips.cc/paper_files/paper/2021/hash/08f90c1a417155361a5c4b8d297e0d78-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11711-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/08f90c1a417155361a5c4b8d297e0d78-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=dxaINwQdXh1
https://papers.nips.cc/paper_files/paper/2021/file/08f90c1a417155361a5c4b8d297e0d78-Supplemental.pdf
In this work, we address risk-averse Bayes-adaptive reinforcement learning. We pose the problem of optimising the conditional value at risk (CVaR) of the total return in Bayes-adaptive Markov decision processes (MDPs). We show that a policy optimising CVaR in this setting is risk-averse to both the epistemic uncertain...
null
Iterative Connecting Probability Estimation for Networks
https://papers.nips.cc/paper_files/paper/2021/hash/0919b5c38396c3f0c41f1112d538e42c-Abstract.html
Yichen Qin, Linhan Yu, Yang Li
https://papers.nips.cc/paper_files/paper/2021/hash/0919b5c38396c3f0c41f1112d538e42c-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11712-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0919b5c38396c3f0c41f1112d538e42c-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=IuH1bVRgvHH
https://papers.nips.cc/paper_files/paper/2021/file/0919b5c38396c3f0c41f1112d538e42c-Supplemental.zip
Estimating the probabilities of connections between vertices in a random network using an observed adjacency matrix is an important task for network data analysis. Many existing estimation methods are based on certain assumptions on network structure, which limit their applicability in practice. Without making strong a...
null
Learning to Adapt via Latent Domains for Adaptive Semantic Segmentation
https://papers.nips.cc/paper_files/paper/2021/hash/092cb13c22d51c22b9035a2b4fe76b00-Abstract.html
Yunan Liu, Shanshan Zhang, Yang Li, Jian Yang
https://papers.nips.cc/paper_files/paper/2021/hash/092cb13c22d51c22b9035a2b4fe76b00-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11713-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/092cb13c22d51c22b9035a2b4fe76b00-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=PEGc7x_QL2
https://papers.nips.cc/paper_files/paper/2021/file/092cb13c22d51c22b9035a2b4fe76b00-Supplemental.pdf
Domain adaptive semantic segmentation aims to transfer knowledge learned from labeled source domain to unlabeled target domain. To narrow down the domain gap and ease adaptation difficulty, some recent methods translate source images to target-like images (latent domains), which are used as supplement or substitute to ...
null
Single Layer Predictive Normalized Maximum Likelihood for Out-of-Distribution Detection
https://papers.nips.cc/paper_files/paper/2021/hash/093b60fd0557804c8ba0cbf1453da22f-Abstract.html
Koby Bibas, Meir Feder, Tal Hassner
https://papers.nips.cc/paper_files/paper/2021/hash/093b60fd0557804c8ba0cbf1453da22f-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11714-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/093b60fd0557804c8ba0cbf1453da22f-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=ympqhd5gE9
https://papers.nips.cc/paper_files/paper/2021/file/093b60fd0557804c8ba0cbf1453da22f-Supplemental.pdf
Detecting out-of-distribution (OOD) samples is vital for developing machine learning based models for critical safety systems. Common approaches for OOD detection assume access to some OOD samples during training which may not be available in a real-life scenario. Instead, we utilize the {\em predictive normalized maxi...
null
Prototypical Cross-Attention Networks for Multiple Object Tracking and Segmentation
https://papers.nips.cc/paper_files/paper/2021/hash/093f65e080a295f8076b1c5722a46aa2-Abstract.html
Lei Ke, Xia Li, Martin Danelljan, Yu-Wing Tai, Chi-Keung Tang, Fisher Yu
https://papers.nips.cc/paper_files/paper/2021/hash/093f65e080a295f8076b1c5722a46aa2-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11715-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/093f65e080a295f8076b1c5722a46aa2-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=OkFPq7ZtsQ
null
Multiple object tracking and segmentation requires detecting, tracking, and segmenting objects belonging to a set of given classes. Most approaches only exploit the temporal dimension to address the association problem, while relying on single frame predictions for the segmentation mask itself. We propose Prototypical ...
null
Algorithmic Instabilities of Accelerated Gradient Descent
https://papers.nips.cc/paper_files/paper/2021/hash/094bb65ef46d3eb4be0a87877ec333eb-Abstract.html
Amit Attia, Tomer Koren
https://papers.nips.cc/paper_files/paper/2021/hash/094bb65ef46d3eb4be0a87877ec333eb-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11716-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/094bb65ef46d3eb4be0a87877ec333eb-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=Am_qvhPRQTq
null
We study the algorithmic stability of Nesterov's accelerated gradient method. For convex quadratic objectives, Chen et al. (2018) proved that the uniform stability of the method grows quadratically with the number of optimization steps, and conjectured that the same is true for the general convex and smooth case. We di...
null
Learning Optimal Predictive Checklists
https://papers.nips.cc/paper_files/paper/2021/hash/09676fac73eda6cac726c43e43e86c58-Abstract.html
Haoran Zhang, Quaid Morris, Berk Ustun, Marzyeh Ghassemi
https://papers.nips.cc/paper_files/paper/2021/hash/09676fac73eda6cac726c43e43e86c58-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11717-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/09676fac73eda6cac726c43e43e86c58-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=bDHBNVtB9XA
https://papers.nips.cc/paper_files/paper/2021/file/09676fac73eda6cac726c43e43e86c58-Supplemental.pdf
Checklists are simple decision aids that are often used to promote safety and reliability in clinical applications. In this paper, we present a method to learn checklists for clinical decision support. We represent predictive checklists as discrete linear classifiers with binary features and unit weights. We then learn...
null
Finite Sample Analysis of Average-Reward TD Learning and $Q$-Learning
https://papers.nips.cc/paper_files/paper/2021/hash/096ffc299200f51751b08da6d865ae95-Abstract.html
Sheng Zhang, Zhe Zhang, Siva Theja Maguluri
https://papers.nips.cc/paper_files/paper/2021/hash/096ffc299200f51751b08da6d865ae95-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11718-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/096ffc299200f51751b08da6d865ae95-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=1Rxp-demAH0
https://papers.nips.cc/paper_files/paper/2021/file/096ffc299200f51751b08da6d865ae95-Supplemental.pdf
The focus of this paper is on sample complexity guarantees of average-reward reinforcement learning algorithms, which are known to be more challenging to study than their discounted-reward counterparts. To the best of our knowledge, we provide the first known finite sample guarantees using both constant and diminishing...
null
Generalization Bounds for Graph Embedding Using Negative Sampling: Linear vs Hyperbolic
https://papers.nips.cc/paper_files/paper/2021/hash/09779bb7930c8a0a44360e12b538ae3c-Abstract.html
Atsushi Suzuki, Atsushi Nitanda, jing wang, Linchuan Xu, Kenji Yamanishi, Marc Cavazza
https://papers.nips.cc/paper_files/paper/2021/hash/09779bb7930c8a0a44360e12b538ae3c-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11719-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/09779bb7930c8a0a44360e12b538ae3c-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=Zfk2NOSWoYg
https://papers.nips.cc/paper_files/paper/2021/file/09779bb7930c8a0a44360e12b538ae3c-Supplemental.pdf
Graph embedding, which represents real-world entities in a mathematical space, has enabled numerous applications such as analyzing natural languages, social networks, biochemical networks, and knowledge bases.It has been experimentally shown that graph embedding in hyperbolic space can represent hierarchical tree-like ...
null
Gradient Starvation: A Learning Proclivity in Neural Networks
https://papers.nips.cc/paper_files/paper/2021/hash/0987b8b338d6c90bbedd8631bc499221-Abstract.html
Mohammad Pezeshki, Oumar Kaba, Yoshua Bengio, Aaron C. Courville, Doina Precup, Guillaume Lajoie
https://papers.nips.cc/paper_files/paper/2021/hash/0987b8b338d6c90bbedd8631bc499221-Abstract.html
NIPS 2021
https://papers.nips.cc/paper_files/paper/11720-/bibtex
https://papers.nips.cc/paper_files/paper/2021/file/0987b8b338d6c90bbedd8631bc499221-Paper.pdf
https://papers.nips.cchttps://openreview.net/forum?id=aExAsh1UHZo
null
We identify and formalize a fundamental gradient descent phenomenon resulting in a learning proclivity in over-parameterized neural networks. Gradient Starvation arises when cross-entropy loss is minimized by capturing only a subset of features relevant for the task, despite the presence of other predictive features th...
null
End of preview. Expand in Data Studio

Neural Information Processing Systems NeurIPS 2021 Accepted Paper Meta Info Dataset

This dataset is collected from the NeurIPS 2021 Advances in Neural Information Processing Systems 35 conference accepted paper (https://papers.nips.cc/paper_files/paper/2021) as well as the arxiv website DeepNLP paper arxiv (http://www.deepnlp.org/content/paper/nips2021). For researchers who are interested in doing analysis of NIPS 2021 accepted papers and potential research trends, you can use the already cleaned up json file in the dataset. Each row contains the meta information of a paper in the NIPS 2021 conference. To explore more AI & Robotic papers (NIPS/ICML/ICLR/IROS/ICRA/etc) and AI equations, feel free to navigate the Equation Search Engine (http://www.deepnlp.org/search/equation) as well as the AI Agent Search Engine to find the deployed AI Apps and Agents (http://www.deepnlp.org/search/agent) in your domain.

Meta Information of Json File

{
    "title": "Backward-Compatible Prediction Updates: A Probabilistic Approach",
    "url": "https://papers.nips.cc/paper_files/paper/2021/hash/012d9fe15b2493f21902cd55603382ec-Abstract.html",
    "authors": "Frederik Tr\u00e4uble, Julius von K\u00fcgelgen, Matth\u00e4us Kleindessner, Francesco Locatello, Bernhard Sch\u00f6lkopf, Peter Gehler",
    "detail_url": "https://papers.nips.cc/paper_files/paper/2021/hash/012d9fe15b2493f21902cd55603382ec-Abstract.html",
    "tags": "NIPS 2021",
    "Bibtex": "https://papers.nips.cc/paper_files/paper/11633-/bibtex",
    "Paper": "https://papers.nips.cc/paper_files/paper/2021/file/012d9fe15b2493f21902cd55603382ec-Paper.pdf",
    "Reviews And Public Comment \u00bb": "https://papers.nips.cchttps://openreview.net/forum?id=YjZoWjTKYvH",
    "Supplemental": "https://papers.nips.cc/paper_files/paper/2021/file/012d9fe15b2493f21902cd55603382ec-Supplemental.pdf",
    "abstract": "When machine learning systems meet real world applications, accuracy is only one of several requirements. In this paper, we assay a complementary perspective originating from the increasing availability of pre-trained and regularly improving state-of-the-art models. While new improved models develop at a fast pace, downstream tasks vary more slowly or stay constant. Assume that we have a large unlabelled data set for which we want to maintain accurate predictions. Whenever a new and presumably better ML models becomes available, we encounter two problems: (i) given a limited budget, which data points should be re-evaluated using the new model?; and (ii) if the new predictions differ from the current ones, should we update? Problem (i) is about compute cost, which matters for very large data sets and models. Problem (ii) is about maintaining consistency of the predictions, which can be highly relevant for downstream applications; our demand is to avoid negative flips, i.e., changing correct to incorrect predictions. In this paper, we formalize the Prediction Update Problem and present an efficient probabilistic approach as answer to the above questions. In extensive experiments on standard classification benchmark data sets, we show that our method outperforms alternative strategies along key metrics for backward-compatible prediction updates."
}

Related

AI Agent Marketplace and Search

AI Agent Marketplace and Search
Robot Search
Equation and Academic search
AI & Robot Comprehensive Search
AI & Robot Question
AI & Robot Community
AI Agent Marketplace Blog

AI Agent Reviews

AI Agent Marketplace Directory
Microsoft AI Agents Reviews
Claude AI Agents Reviews
OpenAI AI Agents Reviews
Saleforce AI Agents Reviews
AI Agent Builder Reviews

AI Equation

List of AI Equations and Latex
List of Math Equations and Latex
List of Physics Equations and Latex
List of Statistics Equations and Latex
List of Machine Learning Equations and Latex

Downloads last month
17