Research
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

3336669991,332 · Jun 202019922001200920172026
48 results for deep generative

This paper analyzes generalization issues in deep reinforcement learning.

problem Understanding and improving generalization capabilities of deep reinforcement learning policies.
method Formalizing and categorizing solutions to address overfitting in deep reinforcement learning.
result A comprehensive analysis of generalization challenges and solutions in deep reinforcement learning.

This paper explains why ResNets generalize better than FFNets using neural tangent kernels.

problem Understanding why deep ResNets generalize better than deep FFNets.
method Using neural tangent kernels to compare the learnability of functions induced by the kernels of ResNets and FFNets.
result The kernel of ResNets does not exhibit degeneracy as depth increases, unlike FFNets.

Bayesian methods enhance deep learning models by improving reliability and uncertainty.

problem Improving reliability and uncertainty awareness in deep learning models.
method Approximate Bayesian inference techniques, including SG-MCMC and VI, applied to deep learning models.
result Enhanced posterior inference for deep learning models, particularly in neural networks and generative models.

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.

Framework generates personalized insulin treatment strategies using deep models.

problem Developing optimal personalized treatment strategies for diabetes patients.
method Combines deep generative time series models with decision theory.
result Demonstrated improved personalized insulin treatment strategies for diabetes patients.

Generalization bounds derived for neural ODEs and deep residual networks.

problem Understanding the generalization capability of neural ODEs and deep residual networks.
method Lipschitz-based argument and analogy with deep residual networks.
result A generalization bound involving the magnitude of weight matrix differences.

Deep reinforcement learning (RL) has achieved breakthrough results on many tasks, but agents often fail to generalize beyond the environment they were trained in. As a result, deep RL algorithms that promote generalization are receiving increasing attention. However, works in this area use a wide variety of tasks and e…

2018-10-29abs ↗pdf ↗

A new deep generative model uses BSDEs for high-dimensional data generation.

problem Generating high-dimensional complex data, especially images.
method Combines BSDEs with deep neural networks for training with MMD loss.
result BSDE-Gen effectively generates high-dimensional data with stochasticity.

Many deep models have been recently proposed for anomaly detection. This paper presents comparison of selected generative deep models and classical anomaly detection methods on an extensive number of non--image benchmark datasets. We provide statistical comparison of the selected models, in many configurations, archite…

2018-07-13abs ↗pdf ↗

DeepDIG generates samples near decision boundaries of deep neural networks for better understanding.

problem Limited knowledge of how deep neural networks make decisions.
method Adversarial example generation to create samples near decision boundaries.
result Characterized decision boundaries of various deep neural network models.

This paper presents a basic property of region dividing of ReLU (rectified linear unit) deep learning when new layers are successively added, by which two new perspectives of interpreting deep learning are given. The first is related to decision trees and forests; we construct a deep learning structure equivalent to a …

2019-06-16abs ↗pdf ↗

Gradient descent methods for deep ReLU networks achieve optimal generalization rates.

problem Generalization of gradient descent methods for deep neural networks
method Establishing minimax-optimal rates for GD and SGD with deep ReLU networks
result Gradient descent methods for deep ReLU networks achieve optimal generalization rates

Study compares random and learned features in deep Bayesian linear models.

problem Understanding how feature learning affects generalization in deep learning.
method Comparing deep random feature models to deep networks with trained layers.
result Random feature models can display double-descent behavior, while deep networks do not.

User smeznar achieved 8th place in PGDL by predicting generalization of deep learning models.

problem Understanding and predicting generalization in deep learning models.
method Creating simple metrics and finding their best combination for automatic testing on a dataset.
result Combination of various properties of neural network architectures can be used for generalization prediction.

The paper explores stability and generalization of deep GCNs.

problem Understanding the stability and generalization of deep GCNs from a theoretical perspective.
method Theoretical analysis of stability and generalization properties of deep GCNs.
result The stability and generalization of deep GCNs are influenced by the maximum absolute eigenvalue of the graph filter operators and the depth of the network.

Synthetic tabular data improves privacy while maintaining model performance.

problem Protecting privacy in synthetic data generation for machine learning.
method Deep generative models for tabular data, emphasizing privacy and model performance.
result Deep generative models enhance synthetic data generation for tabular datasets.

Deep models can't generate heavy-tailed samples well.

problem Understanding the limitations of deep generative models in generating samples with heavy tails.
method Unified framework using concentration of measure and convex geometry, Gromov-Levy inequality.
result Deep generative models are not universal generators and can only produce concentrated samples with light tails.

Lecture notes on linear neural networks for deep learning optimization and generalization.

problem Understanding optimization and generalization in deep learning models.
method Mathematical tools and dynamical systems theory.
result Potential of mathematical tools to enhance understanding of deep learning.

Proposes model-based robust deep learning to handle natural variation in data.

problem Deep learning's fragility to natural variation in data.
method Develops model-based robust training algorithms using deep generative models to learn natural variation.
result Deep neural networks trained with model-based algorithms outperform standard and norm-bounded robust algorithms.

Researchers quantify the relationship between feature depth and performance in deep neural networks.

problem Understanding how depth affects feature extraction and generalization in deep neural networks.
method Adaptive analysis of feature-depth trade-offs in deep nets, proving optimal generalization performance.
result Optimal generalization performance achieved through empirical risk minimization on deep nets.

Generalized linear models with nonlinear feature transformations are widely used for large-scale regression and classification problems with sparse inputs. Memorization of feature interactions through a wide set of cross-product feature transformations are effective and interpretable, while generalization requires more…

2016-06-24abs ↗pdf ↗

Proposes a new generalization bound for Bayesian deep nets without strict assumptions.

problem Lack of generalization bounds for Bayesian deep nets without strict assumptions.
method Exploits contractivity of Log-Sobolev inequalities to add a loss-gradient norm term to the generalization bound.
result Introduces a new generalization bound for Bayesian deep nets that avoids strict assumptions.

Automatically generates a deep RL curriculum for faster and more stable learning.

problem How to automatically generate a curriculum for deep RL agents.
method Interprets curriculum generation as an inference problem, learning task distributions progressively.
result Curricula significantly improve learning performance across various environments and deep RL algorithms.

Deep Discrete Encoders (DDEs) tackle interpretable generative models for rich data with discrete latent layers.

problem Overparametrized, non-identifiable, and uninterpretable deep generative models in high-stakes applications.
method Directed graphical model with multiple binary latent layers, transparent identifiability conditions, scalable estimation pipeline.
result Transparent identifiability conditions and scalable estimation pipeline for interpretable DDEs.

Research proposes a test case generation system for deep learning models using dataset properties.

problem Automated generation of extensive test cases for deep learning models is challenging.
method Measures dataset quality and proposes a test case generation system guided by dataset properties.
result Systematic test case generation for deep learning models is effective.

New deep learning model interprets tabular data with variable selection and explainability.

problem Deep learning models lack interpretability and variable selection.
method Proposes a new network architecture that combines deep learning with generalized linear models.
result The model provides superior predictive power and interpretable results.

Refines deep generative models to improve data density precision.

problem Achieving precise representation of data probability density in deep models.
method Iterated generative modeling to refine latent space, addressing topological obstructions.
result Latent Space Refinement (LaSeR) protocol improves generative model precision.

Deep learning models have lately shown great performance in various fields such as computer vision, speech recognition, speech translation, and natural language processing. However, alongside their state-of-the-art performance, it is still generally unclear what is the source of their generalization ability. Thus, an i…

2018-08-03abs ↗pdf ↗

The paper analyzes how low-rank layers in neural networks improve generalization.

problem Understanding how low-rank layers affect generalization in neural networks.
method Applying Maurer's chain rule for Gaussian complexity to analyze rank and spectral norm constraints.
result Deep networks with low-rank layers achieve better generalization than those with full-rank layers.

Deep generative models parameterized by neural networks have recently achieved state-of-the-art performance in unsupervised and semi-supervised learning. We extend deep generative models with auxiliary variables which improves the variational approximation. The auxiliary variables leave the generative model unchanged b…

2016-02-17abs ↗pdf ↗

We present a method to generate directed acyclic graphs (DAGs) using deep reinforcement learning, specifically deep Q-learning. Generating graphs with specified structures is an important and challenging task in various application fields, however most current graph generation methods produce graphs with undirected edg…

2019-06-05abs ↗pdf ↗

New research shows deep ReLU networks can be learned with polylogarithmic width.

problem Learning deep ReLU networks with limited over-parameterization.
method Using gradient descent, the study establishes learning guarantees for networks with polylogarithmic width.
result Deep ReLU networks can be learned with a polylogarithmic width condition, not just a high degree polynomial.