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.

169,051 papers · 148 categories

Trend · papers per month

227453680906 · Jun 202019922001200920182026
48 results for neural net distance

New neural nets respect triangle inequality, improving graph and reinforcement learning performance.

problem Neural nets lack inductive bias for certain subadditive distances.
method Introduced novel architectures that universally approximate norm-induced metrics.
result Neural nets with triangle inequality inductive bias outperform existing approaches.

Improved training boosts certified robustness of L-infinity distance nets.

problem Certified robustness of L-infinity distance nets is not as strong as conventional networks.
method Improved training process combining scaled cross-entropy and clipped hinge loss with a decaying mixing coefficient.
result Certified accuracy of L-infinity distance nets improved from 33.30% to 40.06% on CIFAR-10.

The paper connects geodesic nets to distance function critical points.

problem Understanding the relationship between geodesic nets and distance function critical points.
method Established a relationship between geodesic nets and critical points of the distance function.
result Bounded the number of balanced points and the length of certain minimizing geodesic nets.

G-Net constructs binary neural networks with high accuracy using randomized binary embeddings.

problem Creating high-accuracy binary neural networks with theoretical guarantees.
method Proposes a novel floating-point G-Net family with randomized binary embeddings and theoretical accuracy guarantees.
result Empirically, G-Net achieves almost 30% higher accuracy on CIFAR-10 compared to prior HDC models.

In human cognition, the expansion of perceived between-category distances and compression of within-category distances is known as categorical perception (CP). There are several hypotheses about the causes of CP (e.g., language, learning, evolution) but no functional model. Whether CP is essential to categorisation or …

2018-05-11abs ↗pdf ↗

We show that training of generative adversarial network (GAN) may not have good generalization properties; e.g., training may appear successful but the trained distribution may be far from target distribution in standard metrics. However, generalization does occur for a weaker metric called neural net distance. It is a…

2017-03-02abs ↗pdf ↗

This research explores the dynamics of linearised neural nets, revealing distinct learning phases and layer growth rates.

problem Understanding the fundamental mechanics of neural nets and their learning dynamics.
method Derivation of properties of learning dynamics in general multi-layer linear neural nets, including orthogonal networks.
result Linear multi-layer neural nets exhibit distinct phases of learning with different layer growth rates, and nonlinearity affects these dynamics.

In this paper, we introduce transformations of deep rectifier networks, enabling the conversion of deep rectifier networks into shallow rectifier networks. We subsequently prove that any rectifier net of any depth can be represented by a maximum of a number of functions that can be realized by a shallow network with a …

2017-03-30abs ↗pdf ↗

The paper evaluates and improves uncertainty estimates in neural networks for safety-critical applications.

problem Quantifying uncertainty in neural networks for safety-critical systems.
method Proposes a statistical test for evaluating uncertainty realism in neural networks and transfers a classification architecture to image-to-image tasks.
result The variational U-Net architecture significantly improves uncertainty realism in image-to-image tasks compared to a plain model.

New training method for neural nets using multilevel entropic regularization.

problem Training efficiency and generalization bounds for neural nets.
method Multilevel relative entropy, chaining mutual information, Gibbs posterior distribution.
result Proves the Gibbs posterior achieves the unique minimum of the empirical risk minimization problem.

Bayesian ReLU nets fix asymptotic overconfidence with infinite features.

problem Bayesian ReLU nets can be asymptotically overconfident far from training data.
method Extend finite ReLU BNNs with infinite ReLU features via a Gaussian process.
result The resulting model is asymptotically maximally uncertain far from the data.

DP-Net uses dynamic programming for efficient deep neural network compression.

problem Efficiently compressing deep neural networks while maintaining accuracy.
method Dynamic Programming for optimal weight quantization and clustering-friendly training.
result Achieves up to 77X compression ratio on Wide ResNet with minimal accuracy loss.

Deep nets improve function approximation and learning in high dimensions.

problem Designing neural networks for rotation-invariant function approximation.
method Developed deep neural networks with multiple hidden layers for radial function approximation.
result Deep nets achieve near-optimal function approximation and learning rates not possible by shallow nets.

Study measures impact of data and neural net similarity on transferability in restaurant sales data.

problem Identify indicators for successful transferability of neural nets across different data sets.
method Empirical study on sales data from six restaurants, calculating indicators based on data and neural net similarities.
result Negative correlations between transferability and indicators, allowing better model performance and fewer transfers.

Learning to Optimize is a recently proposed framework for learning optimization algorithms using reinforcement learning. In this paper, we explore learning an optimization algorithm for training shallow neural nets. Such high-dimensional stochastic optimization problems present interesting challenges for existing reinf…

2017-03-01abs ↗pdf ↗

DNF-Net tackles tabular data challenges with neural architecture.

problem Handling tabular data efficiently using neural networks.
method DNF-Net uses a neural architecture with inductive bias corresponding to logical Boolean formulas in disjunctive normal form over affine soft-threshold decision terms.
result DNF-Net significantly outperforms fully connected networks on tabular data.

SDE-Net quantifies uncertainty in deep nets using stochastic dynamics.

problem Uncertainty quantification in deep neural networks.
method Viewing DNN transformations as state evolution of a stochastic dynamical system, introducing a Brownian motion term for epistemic uncertainty.
result SDE-Net outperforms existing methods in uncertainty estimation across various tasks.

CPOPT-Net predicts sparse client actions in banking using tensor decomposition and neural networks.

problem Predicting sparse client activities in the banking environment with evolving regulations.
method Combines CP tensor decomposition and neural networks for time series predictions.
result CPOPT-Net achieves accurate predictions of clients' financial activities.

fSDE-Net generates time series with long-term memory using neural networks.

problem Generating time series with long-term memory from irregularly sampled data.
method fSDE-Net: neural fractional Stochastic Differential Equation Network using fractional Brownian motion.
result fSDE-Net can replicate distributional properties of real time-series data.

Proposes ΠΠ-Nets, polynomial neural networks, for improved representation power.

problem Improving representation power in deep learning models.
method Introduces ΠΠ-Nets, a new class of deep polynomial neural networks.
result Demonstrates ΠΠ-Nets outperform standard DCNNs and achieve state-of-the-art results.

Rigidity theorem for discrete metric spaces embedded in Riemannian surfaces.

problem Understanding the rigidity of discrete metric spaces embedded in Riemannian surfaces.
method Proving that certain discrete metric spaces are rigidly embedded in the Euclidean plane or other Riemannian surfaces.
result Riemannian embeddings of certain discrete metric spaces are rigid, meaning they cannot be deformed without changing distances.

Study on how reparametrization affects neural nets' parameter spaces from a geometric perspective.

problem Inconsistencies in flatness measures, optimization, and probability densities under reparametrization.
method Riemannian geometry to study invariance of neural nets under reparametrization.
result Invariance of neural nets is an inherent property if the metric is explicitly represented and transformation rules are correct.

Proposes EE-Net for neural exploration in contextual bandits.

problem Exploitation-Exploration tradeoff in contextual bandits.
method Uses two neural networks: Exploitation and Exploration, to learn reward function and adaptively explore.
result Achieves O(TlogT)\mathcal{O}(\sqrt{T\log T}) regret and outperforms existing methods.

IntraVascular UltraSound (IVUS) is one of the most effective imaging modalities that provides assistance to experts in order to diagnose and treat cardiovascular diseases. We address a central problem in IVUS image analysis with Fully Convolutional Network (FCN): automatically delineate the lumen and media-adventitia b…

2018-06-10abs ↗pdf ↗

While Generative Adversarial Networks (GANs) have empirically produced impressive results on learning complex real-world distributions, recent works have shown that they suffer from lack of diversity or mode collapse. The theoretical work of Arora et al. suggests a dilemma about GANs' statistical properties: powerful d…

2018-06-27abs ↗pdf ↗

Improves neural net generalization by modeling hidden state distribution.

problem Brittleness and failure of existing neural nets, especially with sparse labeled data and adversarial training.
method State reification: modeling hidden state distribution and projecting test states towards it.
result Helps neural nets generalize better, especially with sparse labeled data and adversarial training.

Deterministic neural nets have been shown to learn effective predictors on a wide range of machine learning problems. However, as the standard approach is to train the network to minimize a prediction loss, the resultant model remains ignorant to its prediction confidence. Orthogonally to Bayesian neural nets that indi…

2018-06-05abs ↗pdf ↗

We present Optimal Transport GAN (OT-GAN), a variant of generative adversarial nets minimizing a new metric measuring the distance between the generator distribution and the data distribution. This metric, which we call mini-batch energy distance, combines optimal transport in primal form with an energy distance define…

2018-03-15abs ↗pdf ↗

Oracle inequality for sparse neural nets adapts to unknown structure.

problem Sparse deep neural nets in nonparametric regression.
method Gibbs posterior distribution with Metropolis-adjusted Langevin algorithms and mixture of uniform priors.
result Oracle inequality showing adaptation to unknown regularity and structure, achieving minimax-optimal rate of convergence.