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,657 papers · 148 categories

Trend · papers per month

67134201268 · Jun 202019922001200920172026
48 results for Free Convolution

Paper analyzes the free energy of CNNs with skip connections in Bayesian learning.

problem Dependency of CNNs with skip connections on the number of parameters.
method Examines the Bayesian free energy of CNNs with and without skip connections.
result The upper bound of free energy of Bayesian CNN with skip connections does not depend on overparametrization.

ViLT is a faster vision-and-language model without convolution or region supervision.

problem Efficiency and expressive power limitations in current VLP models.
method A convolution-free Vision-and-Language Transformer (ViLT) that processes visual inputs similarly to textual inputs.
result ViLT is up to tens of times faster with competitive or better performance.

Study shows deterministic equivalent for neural network kernel convergence.

problem Understanding convergence of neural network kernels.
method Analyzes empirical spectral distribution of Conjugate Kernel, proving convergence to a deterministic limit.
result Obtains a deterministic equivalent for the Stieltjes transform and resolvent of the Conjugate Kernel.

Study on the geometric Dyson Brownian motion of non-square matrix products.

problem Understanding the spectrum of a product of non-square random matrices.
method Proportional depth-width limit followed by mean-field limit, solving Burgers equation.
result Free log-normal law is obtained in the identity-start case.

Post-hoc explanations improve CNNs by replacing final linear layer with k-means classifier.

problem CNNs lack accurate data representation in their built-in prototypes.
method Introduces k-means-based post-hoc explanations for CNNs, leveraging spatial consistency of convolutional receptive fields.
result Using shallower, less compressed feature activations improves semantic fidelity at the cost of slight predictive performance.

Health professionals can use natural language processing (NLP) technologies when reviewing electronic health records (EHR). Machine learning free-text classifiers can help them identify problems and make critical decisions. We aim to develop deep learning neural network algorithms that identify EHR progress notes perta…

2018-09-16abs ↗pdf ↗

Deep learning has been widely applied and brought breakthroughs in speech recognition, computer vision, and many other domains. The involved deep neural network architectures and computational issues have been well studied in machine learning. But there lacks a theoretical foundation for understanding the approximation…

2018-05-28abs ↗pdf ↗

Learning representation on graph plays a crucial role in numerous tasks of pattern recognition. Different from grid-shaped images/videos, on which local convolution kernels can be lattices, however, graphs are fully coordinate-free on vertices and edges. In this work, we propose a Gaussian-induced convolution (GIC) fra…

2018-11-11abs ↗pdf ↗

This paper shows universality in spectrum behavior for random inner-product kernel matrices in polynomial regime.

problem Understanding spectrum behavior of random inner-product kernel matrices in polynomial regime.
method Analyzing matrices formed by a nonlinear function applied entrywise to a sample-covariance matrix, considering i.i.d. entries with all finite moments.
result The spectrum of random inner-product kernel matrices is universally described by the free convolution of the semicircular and Marčenko-Pastur distributions, with relative weights given by expanding the nonlinear function in the Hermite basis.

In this paper, a geometric framework for neural networks is proposed. This framework uses the inner product space structure underlying the parameter set to perform gradient descent not in a component-based form, but in a coordinate-free manner. Convolutional neural networks are described in this framework in a compact …

2016-08-15abs ↗pdf ↗

Coordinate-independent convolutions on manifolds avoid reference frame ambiguity.

problem Applying convolutions on non-Euclidean manifolds without reference frame ambiguity.
method Developed coordinate-independent and gauge-equivariant convolutions on Riemannian manifolds.
result Coordinate-independent convolutions are equivariant under local gauge transformations.

Graph convolutional neural networks (GCNs) embed nodes in a graph into Euclidean space, which has been shown to incur a large distortion when embedding real-world graphs with scale-free or hierarchical structure. Hyperbolic geometry offers an exciting alternative, as it enables embeddings with much smaller distortion. …

2019-10-28abs ↗pdf ↗

einspace expands NAS search space to include diverse neural architectures.

problem NAS results are often limited to existing structures; new designs are rare.
method einspace uses a probabilistic context-free grammar to create a versatile search space.
result einspace discovers novel and improved architectures, including convolutions and attention.

Most neural networks are trained using first-order optimization methods, which are sensitive to the parameterization of the model. Natural gradient descent is invariant to smooth reparameterizations because it is defined in a coordinate-free way, but tractable approximations are typically defined in terms of coordinate…

2018-08-30abs ↗pdf ↗

Deep models learn to parse complex language structures from local data patterns.

problem Understanding how deep models parse and represent language structures.
method Introduced tunable probabilistic context-free grammars and a learning algorithm inspired by deep networks.
result Data correlations across scales enable hierarchical language representations.

Second-order methods for neural network optimization have several advantages over methods based on first-order gradient descent, including better scaling to large mini-batch sizes and fewer updates needed for convergence. But they are rarely applied to deep learning in practice because of high computational cost and th…

2017-12-20abs ↗pdf ↗

We analyze the eigenvalue distribution of a neural network's kernel under specific scaling.

problem Analyzing the eigenvalue distribution of the Neural Tangent Kernel (NTK) of a neural network.
method Asymptotic analysis of the NTK matrix under given scaling conditions.
result The eigenvalue distribution is described as a free multiplicative convolution of the Marchenko-Pastur distribution and a deterministic distribution.

New method predicts neural network performance using free probability theory.

problem Stability and performance prediction of feed-forward neural networks.
method Free Probability Theory and homotopy method for Jacobian spectral density computation.
result FPT metrics correlate highly with final test accuracies of neural networks.

The paper develops a new probabilistic framework for denoising diffusion models using free entropy and stochastic analysis.

problem Developing a mathematical framework for denoising diffusion models in noncommutative settings.
method Formulating diffusion and reverse processes governed by operator-valued stochastic dynamics, using tools from free stochastic analysis.
result Establishing an information-geometric link between entropy production, transport, and deconvolution.

Transformer models perform slower than convolutional networks in learning hierarchical language structures.

problem Understanding how neural networks learn hierarchical language structures.
method Theoretical scaling laws and empirical validation of neural network performance.
result Convolutional networks outperform transformers in learning hierarchical language structures.

We propose a statistical learning-based traffic speed estimation method that uses sparse vehicle trajectory information. Using a convolutional encoder-decoder based architecture, we show that a well trained neural network can learn spatio-temporal traffic speed dynamics from time-space diagrams. We demonstrate this for…

2020-01-21abs ↗pdf ↗

Meta-learning is a promising method to achieve efficient training method towards deep neural net and has been attracting increases interests in recent years. But most of the current methods are still not capable to train complex neuron net model with long-time training process. In this paper, a novel second-order meta-…

2018-05-22abs ↗pdf ↗

Analog arrays are a promising upcoming hardware technology with the potential to drastically speed up deep learning. Their main advantage is that they compute matrix-vector products in constant time, irrespective of the size of the matrix. However, early convolution layers in ConvNets map very unfavorably onto analog a…

2018-07-03abs ↗pdf ↗

This paper explains GCNs using NTKs and improves their performance.

problem GCNs' performance degrades with depth, and skip connections marginally improve it.
method Derive NTKs for GCNs, validate with simulations, propose NTK as a surrogate model.
result Suitable normalisation can prevent drastic performance drop with depth.

Automated protein structure prediction from cryo-EM data.

problem Challenging to build atomic models from cryo-EM densities without prior structure.
method Uses GCN and LSTM to automate model building from amino acid identities and candidate locations.
result Automated approach reduces time and eliminates human intervention for protein structure determination.

Parametric statistical models that are implicitly defined in terms of a stochastic data generating process are used in a wide range of scientific disciplines because they enable accurate modeling. However, learning the parameters from observed data is generally very difficult because their likelihood function is typica…

2018-10-23abs ↗pdf ↗

The field of reinforcement learning (RL) is facing increasingly challenging domains with combinatorial complexity. For an RL agent to address these challenges, it is essential that it can plan effectively. Prior work has typically utilized an explicit model of the environment, combined with a specific planning algorith…

2019-01-11abs ↗pdf ↗

Generative adversarial networks fix aliasing issues by making signals continuous.

problem Alias-free generation in GANs to prevent unwanted information leakage.
method Interpreting all signals as continuous, deriving small architectural changes.
result Generative models match FID of StyleGAN2 but have better internal representations.

Phase segregation, the process by which the components of a binary mixture spontaneously separate, is a key process in the evolution and design of many chemical, mechanical, and biological systems. In this work, we present a data-driven approach for the learning, modeling, and prediction of phase segregation. A direct …

2018-03-23abs ↗pdf ↗