Abstracts index for ML4H workshop at NeurIPS 2019.
problem No specific problem stated; index of accepted abstracts.
method Not specified; index of accepted abstracts.
result No specific result stated.
On-device research index
arXiv research
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.
168,742 papers · 148 categories
Trend · papers per month
48 results for “NeurIPS 2019”
Replication confirms CGD's effectiveness in competitive games.
problem Reproducibility of a novel Nash equilibrium algorithm.
method Replicated experiments and provided Python implementation.
result CGD avoids oscillatory and divergent behaviours.
Improved disentanglement in VAEs using aggregated feature maps.
problem Improving disentanglement in Variational Autoencoders (VAEs).
method Regionally aggregated feature maps extracted from pre-trained CNNs on ImageNet.
result 2nd place in NeurIPS 2019 disentanglement challenge.
NeurIPS 2019 program improves reproducibility in machine learning.
problem Ensuring machine learning research results are reproducible and reliable.
method Code submission policy, reproducibility challenge, and checklist integration.
result Improved reproducibility standards across the machine learning community.
Researchers improved Minecraft game performance using imitation learning.
problem Achieving state-of-the-art performance in immersive environments like Minecraft.
method Applied imitation learning to Minecraft, optimizing network architecture, loss function, and data augmentation.
result Reported stronger results than previous experiments, reaching second place in a competition.
Improved disentanglement through learned feature aggregation.
problem Disentangling latent factors in images.
method Variational autoencoder trained on regionally aggregated feature maps from ImageNet.
result 2nd place in NeurIPS 2019 disentanglement challenge.
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…
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…
Catalyst.RL accelerates RL research with efficient training.
problem Efficient reinforcement learning training in complex environments.
method Open-source PyTorch framework with distributed training and RL algorithms.
result Catalyst.RL achieved 2nd place in a computationally expensive RL challenge.
New findings show limitations in converting private learning to online learning efficiently.
problem Limitations in converting private learning to online learning efficiently.
method Assuming one-way functions, we show an efficient conversion from pure-private learners to online learners is impossible.
result Efficient conversion from pure-private learners to online learners is impossible under certain assumptions.
Retrospective Analysis of the 2019 MineRL Competition on Sample Efficient Reinforcement Learningcs.LG
MineRL Competition reduced reinforcement learning sample needs.
problem Sample inefficiency in reinforcement learning.
method Human demonstrations and imitation learning integrated into reinforcement learning algorithms.
result Top solutions used deep reinforcement learning and imitation learning.
Improved learning bounds for corrupted data using thresholded gradient descent.
problem Learning from corrupted data with adversarial noise.
method Thresholded gradient descent for sigmoidal, leaky-ReLU, and ReLU activations.
result Improved approximation bounds for various activation functions.
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.
New property ensures neural networks generalize well with limited data.
problem Limited training data limits model generalization in neural networks.
method Introduces NeuRIP, a uniform concentration event for ReLU networks.
result All shallow ReLU networks generalize uniformly if they achieve NeuRIP.
Disentanglement-PyTorch library facilitates disentangled representation learning.
problem Unsupervised learning of disentangled representations.
method Modular library for variational algorithms, decoupling architectures, latent space, and training algorithms.
result Achieved 3rd rank in NeurIPS 2019 Disentanglement Challenge.
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.
problem Optimizing long-term drone racing strategies using reinforcement learning.
method Used PPO algorithm on a simulated quadrotor in a racing environment created with AirSim.
result Deep RL agent outperformed classical path planning in drone racing competitions.
Squirrel switches between optimizers for better performance.
problem Finding the best optimizer for a given problem.
method Switches between different optimizers based on performance.
result Improves performance on various problems.
AI agents beat previous best on NetHack, but symbolic bots still outperform.
problem Developing AI agents that can ascend in the NetHack game.
method Used a procedurally generated NetHack Learning Environment for reinforcement learning.
result Symbolic bots outperform neural approaches on NetHack.
Survey on random features for kernel approximation, focusing on algorithms, theory, and practical applications.
problem Efficiently approximating kernel methods for large-scale problems.
method Random features techniques to speed up kernel methods.
result Need for a high number of random features for good approximation quality.
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…
New algorithms predict causal links better than traditional methods in time series data.
problem Learning causal structure from time series data with challenges in real-world Earth sciences.
method Combination of established ideas for linear methods to identify causal links in non-linear systems, with a focus on large regression coefficients.
result Large regression coefficients can predict causal links better than small p-values in practice.
NeurIPS 2020 competition seeks to predict deep learning generalization.
problem Understanding and predicting generalization in deep learning models.
method Propose complexity measures to accurately predict generalization performance.
result A robust complexity measure could improve deep learning reliability.
Improved neural network training by coupled initialization reduces neuron count.
problem Training neural networks efficiently with fewer neurons.
method Coupled initialization of weights into pairs of identical Gaussian vectors.
result Significantly reduced number of neurons required for network convergence.
A new framework for verifying robustness of neural networks.
problem Verifying the robustness of neural networks against adversarial attacks.
method LayerCert framework exploiting the nested hyperplane arrangement structure of ReLU networks.
result LayerCert reduces the number and size of convex programs needed for robustness verification.
New algorithm selects best distribution privately in nearly-linear time.
problem Estimating the best distribution from samples under differential privacy constraints.
method Differentially private algorithm with nearly-linear time complexity and optimal approximation factor.
result Achieves optimal approximation factor of 3 with modest sample complexity increase.
New adaptive attacks bypass many defenses to adversarial examples.
problem Adversarial example defenses are not adequately evaluated using adaptive attacks.
method Detailed analysis of thirteen defenses, demonstrating their vulnerabilities to adaptive attacks.
result Adversarial example defenses are more vulnerable to adaptive attacks than previously thought.
Improved algorithm for contextual bandits with reduced regret.
problem Adversarial contextual bandits with i.i.d. contexts.
method Oracle-efficient relaxation with regret bound.
result First to improve regret bound and match original bound for stochastic case.
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.
problem Optimizing hyperparameters of machine learning models using derivative-free methods.
method Bayesian optimization vs. random search on real datasets.
result Bayesian optimization significantly outperformed random search in held-out objective functions.
We give a twistorial interpretation of geometric structures on a Riemannian manifold, as sections of homogeneous fibre bundles, following an original insight by Wood (2003). The natural Dirichlet energy induces an abstract harmonicity condition, which gives rise to a geometric gradient flow. We establish a number of an…
New machine learning pipeline solves dynamic vehicle routing problems efficiently.
problem Efficiently handling same day deliveries in e-commerce logistics.
method Combination of machine learning and combinatorial optimization.
result Ranked first in the EURO Meets NeurIPS Vehicle Routing Competition.
The VoxCeleb Speaker Recognition Challenge 2019 aimed to assess how well current speaker recognition technology is able to identify speakers in unconstrained or `in the wild' data. It consisted of: (i) a publicly available speaker recognition dataset from YouTube videos together with ground truth annotation and standar…
Competition aims to develop sample-efficient reinforcement learning methods.
problem Limited access to samples in reinforcement learning.
method Develops algorithms leveraging human demonstrations in Minecraft.
result Fosters innovation in sample-efficient reinforcement learning.
This paper describes our system submitted to SemEval 2019 Task 7: RumourEval 2019: Determining Rumour Veracity and Support for Rumours, Subtask A (Gorrell et al., 2019). The challenge focused on classifying whether posts from Twitter and Reddit support, deny, query, or comment a hidden rumour, truthfulness of which is …
New findings show transfer learning is possible even when density ratios are unbounded.
problem Transfer learning under unbounded density ratios.
method Low-degree polynomial estimators, general transfer inequality over .
result Non-trivial transfer learning possible under mild assumptions, including log-concave measures.
Challenge hides and seeks privacy in clinical time-series data.
problem De-identifying clinical time-series data while preserving utility and privacy.
method Synthetic data generation to preserve temporal dynamics and limit re-identification risk.
result A novel competition tracks synthetic data generation and patient re-identification.
We compare two recently proposed methods that combine ideas from conformal inference and quantile regression to produce locally adaptive and marginally valid prediction intervals under sample exchangeability (Romano et al., 2019; Kivaranovic et al., 2019). First, we prove that these two approaches are asymptotically ef…
Analyzed US firm data 1970-2019, identifying scale effects and distributional forms.
problem Understanding differences between small and large firms over time.
method Examined all public US firms, used stylized facts and DLN distribution analysis.
result Small firms are systematically different from large firms, with scale-dependent heteroskedasticity.
Study shows simple vector quantization measures correlate with deep learning generalization.
problem Understanding and predicting generalization in deep learning models.
method Applying complexity measures from approximation and information theory to deep learning features.
result Simple vector quantization measures correlate well with generalization performance in deep learning.
Ogburn et al. (2019, arXiv:1910.05438) discuss "The Blessings of Multiple Causes" (Wang and Blei, 2018, arXiv:1805.06826). Many of their remarks are interesting. But they also claim that the paper has "foundational errors" and that its "premise is...incorrect." These claims are not substantiated. There are no foundatio…
Improved deep neural network generalization through noise resilience.
problem Understanding and predicting generalization error of deep neural networks.
method Noise resilience measures to predict generalization error.
result Secured 5th position in the PGDL competition at NeurIPS 2020.
Investigates the relationship between US money supply and asset indices over 2001-2019.
problem Determining the relationship between US money supply and asset indices growth.
method Information entropy methodology applied to US asset indices (Property, Russell 2000, S&P 500, NASDAQ) over 2001-2019.
result Growth in US broad money supply is the main determinant of US asset indices growth, especially the NASDAQ and Russell 2000.
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…
Lectures on symplectic aspects of surface degenerations at KIAS.
problem Exploring symplectic structures in surface degenerations.
method Expository account of symplectic aspects of cyclic quotient surface singularities.
result Discussion of symplectic structures in surface degenerations.
Revisits causal inference identifiability with positivity assumption.
problem General identifiability in causal inference without positivity assumption.
method Introduces new algorithm sound and complete under positivity assumption.
result New algorithm connects general identifiability to classical identifiability.
Improved privacy-preserving methods for estimating multiple samples from distributions.
problem Estimating multiple samples from distributions while maintaining privacy.
method Developed new multi-sampling techniques for differentially private data estimation.
result Achieved significant reduction in sample complexity for multi-sampling from finite domains and Gaussian distributions.