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

96191287382 · Jun 202019922001200920182026
48 results for non-linear output transformations

Develops a new model for deep structured prediction with non-linear output transformations.

problem Limited neighborhood structure and inability to transform output space in deep structured models.
method Introduces a novel model that generalizes existing approaches and maintains applicability of inference techniques.
result Demonstrates improved flexibility and applicability of deep structured models through non-linear output transformations.

Paper converts deep networks to flat, equivalent kernel machines.

problem Capacity control and uniform convergence in deep learning.
method Push-forward transformation from deep networks to indefinite kernel machines.
result Flat network weights are Lp-norm regularized (0<p<1).

Paper introduces non-linear process convolutions for multi-output Gaussian processes.

problem Building accurate covariance functions for multi-output Gaussian processes.
method Volterra series for non-linearity, closed-form expressions for mean and covariance.
result Non-linear model outperforms classical process convolution in synthetic and real datasets.

ALAMO is a computational methodology for leaning algebraic functions from data. Given a data set, the approach begins by building a low-complexity, linear model composed of explicit non-linear transformations of the independent variables. Linear combinations of these non-linear transformations allow a linear model to b…

2017-05-31abs ↗pdf ↗

Neural networks use their hidden layers to transform input data into linearly separable data clusters, with a linear or a perceptron type output layer making the final projection on the line perpendicular to the discriminating hyperplane. For complex data with multimodal distributions this transformation is difficult t…

2018-07-08abs ↗pdf ↗

Different neural networks learn similar mappings with different weights.

problem Understanding shared representations across neural networks with varying weights.
method Shared response model and orthogonal transformations.
result Different neural networks encode the same input examples as different orthogonal transformations of an underlying shared representation.

Transformer attention layers solve single-location regression tasks.

problem Understanding token-wise sparsity and internal linear representations in attention-based models.
method Introduce single-location regression task and a simplified predictor based on self-attention layers.
result Transformer attention layers are asymptotically Bayes optimal and can learn underlying structures effectively.

Paper learns dynamic generator models for video sequences.

problem Modeling spatial-temporal processes like dynamic textures and actions.
method Alternating back-propagation through time algorithm to learn latent state vectors and generator model.
result Trains realistic models for dynamic textures and actions.

This paper tackles efficient and scalable estimation of a complex model involving stochastic linear combinations of non-linear regressions.

problem Estimating a model involving stochastic linear combinations of non-linear regressions efficiently and scalably.
method The paper provides algorithms for estimating the model under specific assumptions about the variate vector and sample size, using techniques like zero-bias transformation and sub-sampling.
result The paper provides theoretical guarantees for the estimation of the model, showing that the estimation errors are of the order O(pn)O(\sqrt{\frac{p}{n}}) and O(1p+pn)O(\frac{1}{\sqrt{p}}+\sqrt{\frac{p}{n}}) with high probability.

Unified framework for non-linear attention using modern Hopfield networks.

problem Improving transformer model's understanding of complex relationships and efficiency.
method Proposes an energy functional based on Modern Hopfield Networks (MNH) to unify linear and non-linear attention mechanisms.
result Context wells encapsulate contextual relationships among tokens, offering a richer representation of non-linear data.

HFNO enhances interpretability of turbulent flows through parallel wavenumber bin processing.

problem Opaque inner workings of Fourier Neural Operators (FNOs) hinder physical interpretability.
method Introduces HFNO, a novel FNO-based architecture that processes wavenumber bins in parallel, enhancing interpretability.
result HFNO decomposes turbulent flows across various scales, enabling increased interpretability and multiscale modeling.

The dynamic emulation of non-linear deterministic computer codes where the output is a time series, possibly multivariate, is examined. Such computer models simulate the evolution of some real-world phenomenon over time, for example models of the climate or the functioning of the human brain. The models we are interest…

2018-02-21abs ↗pdf ↗

A new algorithm estimates output ranges for deep neural networks efficiently.

problem Estimating output ranges in deep neural networks with complex non-linearities.
method Integrates Simulated Annealing tailored for constrained domains and global optima.
result Guaranteed convergence and robust performance across various DNN architectures.

Variational auto-encoder frameworks have demonstrated success in reducing complex nonlinear dynamics in molecular simulation to a single non-linear embedding. In this work, we illustrate how this non-linear latent embedding can be used as a collective variable for enhanced sampling, and present a simple modification th…

2018-01-02abs ↗pdf ↗

Paper uses black-box inference to estimate non-linear latent force models.

problem Estimating posterior state and forcing term in non-linear systems with unknown forcing terms.
method Black-box variational inference with local inverse autoregressive flows.
result Demonstrates effectiveness of approximation on known posterior systems and non-linear dynamics.

Variational inference is a powerful tool for approximate inference, and it has been recently applied for representation learning with deep generative models. We develop the variational Gaussian process (VGP), a Bayesian nonparametric variational family, which adapts its shape to match complex posterior distributions. T…

2015-11-20abs ↗pdf ↗

Regularizes GAMs to improve interpretability by reducing concurvity.

problem Susceptibility of GAMs to concurvity reduces interpretability.
method Proposes a regularizer to penalize pairwise correlations of non-linearly transformed features.
result Improves interpretability and reduces concurvity without sacrificing prediction quality.

We propose a novel kernel based post selection inference (PSI) algorithm, which can not only handle non-linearity in data but also structured output such as multi-dimensional and multi-label outputs. Specifically, we develop a PSI algorithm for independence measures, and propose the Hilbert-Schmidt Independence Criteri…

2016-10-12abs ↗pdf ↗

This paper recovers input data from transformer models using attention weights.

problem Recovering input data from transformer models for security and privacy concerns.
method Introducing an algorithm to minimize the loss function between expected and actual outputs of transformers.
result The algorithm successfully recovers input data from attention weights and outputs of transformers.

In this paper, we generalize the famous Hasimoto's transformation by showing that the dynamics of a closed unidimensional vortex filament embedded in a three-dimensional manifold of constant curvature gives rise under Hasimoto's transformation to the non-linear Schrodinger equation. We also give a natural interpretatio…

2012-04-24abs ↗pdf ↗

We introduce the Randomized Dependence Coefficient (RDC), a measure of non-linear dependence between random variables of arbitrary dimension based on the Hirschfeld-Gebelein-Rényi Maximum Correlation Coefficient. RDC is defined in terms of correlation of random non-linear copula projections; it is invariant with respec…

2013-04-29abs ↗pdf ↗

CMTRF improves recommendation accuracy by transforming rating scales.

problem Non-linear transformation of rating scales disrupts low-rank structure in rating matrices.
method CMTRF performs regression up to unknown monotonic transforms over user segments, coupled with matrix factorization.
result CMTRF outperforms other baselines in synthetic and real-world datasets.

Transformer with denoising diffusion improves probabilistic density estimation.

problem Estimating non-Gaussian and multimodal probability distributions for regression problems.
method Training a denoising diffusion head on top of a Transformer model.
result The model provides reasonable probability density estimation for high-dimensional inputs.

Transformers use a unique Hessian structure that differs from classical networks, affecting optimization.

problem Understanding the unique optimization landscape of Transformers.
method Theoretical Hessian analysis of a single self-attention layer in Transformers.
result Transformers have a highly non-linear Hessian structure, distinguishing them from classical networks.

This paper explains a mechanism called phase collapse that improves image classification accuracy.

problem Understanding the role of non-linearities and convolutional filters in image classification.
method Demonstrates phase collapse as a mechanism that eliminates spatial variability and linearly separates classes.
result Phase collapse improves classification accuracy, while thresholding operators degrade performance.

The goal of supervised feature selection is to find a subset of input features that are responsible for predicting output values. The least absolute shrinkage and selection operator (Lasso) allows computationally efficient feature selection based on linear dependency between input features and output values. In this pa…

2012-02-02abs ↗pdf ↗

Paper investigates Lipschitz constants of self-attention modules in neural networks.

problem Lipschitz constants of self-attention modules in neural networks.
method Proved standard dot-product self-attention is not Lipschitz for unbounded input domain. Proposed L2 self-attention that is Lipschitz. Derived upper bound on L2 self-attention's Lipschitz constant.
result Proved standard self-attention is not Lipschitz for unbounded input domain and proposed an alternative L2 self-attention that is Lipschitz.