A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
Survey on random features for kernel approximation, focusing on algorithms, theory, and practical applications.
Abstracts index for ML4H workshop at NeurIPS 2019.
This is the Proceedings of NeurIPS 2018 Workshop on Machine Learning for the Developing World: Achieving Sustainable Impact, held in Montreal, Canada on December 8, 2018
This volume represents the accepted submissions from the Machine Learning for Health (ML4H) workshop at the conference on Neural Information Processing Systems (NeurIPS) 2018, held on December 8, 2018 in Montreal, Canada.
Improved disentanglement in VAEs using aggregated feature maps.
New property ensures neural networks generalize well with limited data.
Replication confirms CGD's effectiveness in competitive games.
NeurIPS 2019 program improves reproducibility in machine learning.
Squirrel switches between optimizers for better performance.
AI agents beat previous best on NetHack, but symbolic bots still outperform.
We organized a competition on Autonomous Lifelong Machine Learning with Drift that was part of the competition program of NeurIPS 2018. This data driven competition asked participants to develop computer programs capable of solving supervised learning problems where the i.i.d. assumption did not hold. Large data sets w…
NeurIPS 2020 competition seeks to predict deep learning generalization.
Researchers improved Minecraft game performance using imitation learning.
Improved disentanglement through learned feature aggregation.
The areas of machine learning and knowledge discovery in databases have considerably matured in recent years. In this article, we briefly review recent developments as well as classical algorithms that stood the test of time. Our goal is to provide a general introduction into different tasks such as learning from tabul…
New adaptive attacks bypass many defenses to adversarial examples.
Improved algorithm for contextual bandits with reduced regret.
Catalyst.RL accelerates RL research with efficient training.
Objective: To determine the completeness of argumentative steps necessary to conclude effectiveness of an algorithm in a sample of current ML/AI supervised learning literature. Data Sources: Papers published in the Neural Information Processing Systems (NeurIPS, née NIPS) journal where the official record showed a 2017…
Bayesian optimization outperformed random search in machine learning hyperparameter tuning challenge.
New machine learning pipeline solves dynamic vehicle routing problems efficiently.
Improved learning bounds for corrupted data using thresholded gradient descent.
Causal inference uses observations to infer the causal structure of the data generating system. We study a class of functional models that we call Time Series Models with Independent Noise (TiMINo). These models require independent residual time series, whereas traditional methods like Granger causality exploit the var…
Challenge hides and seeks privacy in clinical time-series data.
Study shows simple vector quantization measures correlate with deep learning generalization.
Improved deep neural network generalization through noise resilience.
In the NeurIPS 2018 Artificial Intelligence for Prosthetics challenge, participants were tasked with building a controller for a musculoskeletal model with a goal of matching a given time-varying velocity vector. Top participants were invited to describe their algorithms. In this work, we describe the challenge and pre…
Extended LSTM improves language modeling performance.
This work is a reproducibility study of the paper of Antoniou and Storkey [2019], published at NeurIPS 2019. Our results are in parts similar to the ones reported in the original paper, supporting the central claim of the paper that the proposed novel method, called Self-Critique and Adapt (SCA), improves the performan…
Improved privacy-preserving methods for estimating multiple samples from distributions.
Innovation is to organizations what evolution is to organisms: it is how organisations adapt to changes in the environment and improve. Governments, institutions and firms that innovate are more likely to prosper and stand the test of time; those that fail to do so fall behind their competitors and succumb to market an…
While many solutions for privacy-preserving convex empirical risk minimization (ERM) have been developed, privacy-preserving nonconvex ERM remains a challenge. We study nonconvex ERM, which takes the form of minimizing a finite-sum of nonconvex loss functions over a training set. We propose a new differentially private…
Improved reinforcement learning in Minecraft with human demonstrations.
We study a multiplayer stochastic multi-armed bandit problem in which players cannot communicate, and if two or more players pull the same arm, a collision occurs and the involved players receive zero reward. We consider the challenging heterogeneous setting, in which different arms may have different means for differe…
We describe the submission of the Quo Vadis team to the Traffic4cast competition, which was organized as part of the NeurIPS 2019 series of challenges. Our system consists of a temporal regression module, implemented as 2d convolutions, augmented with spatio-temporal biases. We have found that using biases i…
New findings show limitations in converting private learning to online learning efficiently.
MineRL Competition reduced reinforcement learning sample needs.
We consider adversarial examples for image classification in the black-box decision-based setting. Here, an attacker cannot access confidence scores, but only the final label. Most attacks for this scenario are either unreliable or inefficient. Focusing on the latter, we show that a specific class of attacks, Boundary …
Disentanglement-PyTorch library facilitates disentangled representation learning.
Ringmaster ASGD improves Asynchronous SGD's efficiency under varying worker times.
Schedule-free SGD is optimal for nonconvex optimization problems.
We identify a trade-off between robustness and accuracy that serves as a guiding principle in the design of defenses against adversarial examples. Although this problem has been widely studied empirically, much remains unknown concerning the theory underlying this trade-off. In this work, we decompose the prediction er…
In this paper we introduce a new approach to topic modelling that scales to large datasets by using a compact representation of the data and by leveraging the GPU architecture. In this approach, topics are learned directly from the co-occurrence data of the corpus. In particular, we introduce a novel mixture model whic…
Despite the recent progress in deep reinforcement learning field (RL), and, arguably because of it, a large body of work remains to be done in reproducing and carefully comparing different RL algorithms. We present catalyst.RL, an open source framework for RL research with a focus on reproducibility and flexibility. Ma…
Disentangled encoding is an important step towards a better representation learning. However, despite the numerous efforts, there still is no clear winner that captures the independent features of the data in an unsupervised fashion. In this work we empirically evaluate the performance of six unsupervised disentangleme…
Deep RL drone trained to compete against classical path planning in drone racing.
We derive generalization and excess risk bounds for neural nets using a family of complexity measures based on a multilevel relative entropy. The bounds are obtained by introducing the notion of generated hierarchical coverings of neural nets and by using the technique of chaining mutual information introduced in Asadi…
The paper explains how nearest neighbor methods succeed in prediction.