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

Trend · papers per month

52103155206 · Jun 202019922001200920172026
48 results for residual gap-aware transformers

Transformers improve Alzheimer's disease progression prediction by accounting for irregular biomarker histories.

problem Difficult prediction of medium-horizon Alzheimer's disease progression due to tied clinical scores and irregular biomarker observations.
method Developed a residual gap-aware transformer that combines statistical reference with transformer-based residual learning.
result The proposed model reduces mean error and improves prediction-observation correlation compared to baseline models.

Cloud computing is becoming increasingly popular as a platform for distributed training of deep neural networks. Synchronous stochastic gradient descent (SSGD) suffers from substantial slowdowns due to stragglers if the environment is non-dedicated, as is common in cloud computing. Asynchronous SGD (ASGD) methods are i…

2019-09-24abs ↗pdf ↗

Proposes a neural network method to correct residual distortions in coordinate transformations.

problem Nonlinear and spatially dependent distortions in coordinate transformation models.
method Residual-based neural network approach focusing on systematic distortions.
result The method improves accuracy and stability in challenging conditions.

A new model improves CT image quality from low-dose scans.

problem Improving CT image quality from low-dose scans.
method Multi-layer Residual Sparsifying Transform (MRST) learning model for low-dose CT reconstruction.
result The MRST model outperforms conventional methods in maintaining subtle details.

Two methods are proposed to filter correlations in DCC-GARCH residuals for foreign exchange rates.

problem Filtering correlations in DCC-GARCH residuals for accurate foreign exchange rate prediction.
method Two approaches: estimating correlation matrix as a parameter and using eigenvalue decomposition.
result The DCC-GARCH residual can be almost independent using these methods.

Framework calculates positional influence in causal residual Transformers.

problem Understanding positional influence in causal residual Transformers.
method Adjoint-sensitivity framework for positional influence in causal residual Transformers.
result Exact evolution of adjoint-energy influence density and decomposition into residual transmission, nonlocal Volterra, and local channels.

Researchers prove Transformers are Turing-complete and analyze their components.

problem Understanding the computational power and limitations of Transformers.
method Analyzed Turing-completeness of vanilla and modified Transformers, and necessity of components.
result Transformers with positional masking and positional encodings are Turing-complete.

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 ↗

We prove the homotopy invariance of L^2 torsion for covering spaces, whenever the covering transformation group is either residually finite or amenable. In the case when the covering transformation group is residually finite and when the L^2 cohomology of the covering space vanishes, the homotopy invariance was establi…

1997-06-06abs ↗pdf ↗

Study Transformer layers under cross-entropy training using mean field control.

problem Understanding the behavior of Transformer layers in cross-entropy training.
method Continuous-depth mean field control analysis, treating depth as time and layer parameters as controls.
result Derivation of a Pontryagin condition for the limiting population problem, involving the softmax residual.

Flow-based generative models parameterize probability distributions through an invertible transformation and can be trained by maximum likelihood. Invertible residual networks provide a flexible family of transformations where only Lipschitz conditions rather than strict architectural constraints are needed for enforci…

2019-06-06abs ↗pdf ↗

Deep linear ResNets converge globally with certain transformations.

problem Global convergence of training deep linear ResNets.
method Gradient descent and stochastic gradient descent for training LL-hidden-layer linear ResNets.
result GD and SGD can converge to global minimum for deep linear ResNets with specific transformations.

Researchers relax the CVF's smoothness requirement to create more flexible flow models.

problem Challenges in constructing flexible density models due to the CVF's smoothness requirement.
method Introduce L\mathcal{L}-diffeomorphisms as generalized transformations that may violate smoothness on zero Lebesgue-measure sets.
result The relaxation allows for the use of non-smooth activation functions like ReLU in residual flows.

The paper introduces a diagnostic method to detect grokking transitions in models before test accuracy improves.

problem Detecting the transition from training to generalization in machine learning models.
method Summarize task-dependent observables as empirical distributions, map them to Wasserstein/quantile coordinates, and analyze using Hankel dynamic mode decomposition.
result The diagnostic method achieves AUROC \(\approx\) 0.93 for grokking-vs-non-grokking discrimination at the run level.

Large Transformer models routinely achieve state-of-the-art results on a number of tasks but training these models can be prohibitively costly, especially on long sequences. We introduce two techniques to improve the efficiency of Transformers. For one, we replace dot-product attention by one that uses locality-sensiti…

2020-01-13abs ↗pdf ↗

We introduce a general method of performing Residual Network inference and learning in the JPEG transform domain that allows the network to consume compressed images as input. Our formulation leverages the linearity of the JPEG transform to redefine convolution and batch normalization with a tune-able numerical approxi…

2018-12-31abs ↗pdf ↗

The study analyzes numerical stability in large language models using mixed-precision arithmetic.

problem Numerical stability of large language models using low-precision arithmetic.
method Developed a mixed-precision analysis of transformer inference, deriving bounds for condition numbers and forward error.
result Established that numerical stability is determined by the interplay between weight magnitude and the growth of the residual stream.

In many video coding systems, separable transforms (such as two-dimensional DCT-2) have been used to code block residual signals obtained after prediction. This paper proposes a parametric approach to build graph-based separable transforms (GBSTs) for video coding. Specifically, a GBST is derived from a pair of line gr…

2019-11-16abs ↗pdf ↗

A new model classifies lightning signals more accurately across different scales.

problem Classifying VLF lightning transients to reduce interference and improve navigation system reliability.
method Introduces a multi-scale residual transformer (MRTransformer) to classify lightning signals.
result Achieved 90% accuracy in lightning signal classification.

Efficient Winograd convolution for INT8 networks using RNS.

problem Difficulty in applying Winograd algorithm to low-precision quantized networks.
method Extends Winograd algorithm to Residue Number System (RNS) for efficient INT8 convolution.
result Arithmetic complexity reduction up to 7.03x with performance improvement up to 2.30x-4.69x.

We study conformal SpinSpin-subgeometry of submanifolds in a semi-Riemannian SpinSpin-manifold, focusing on conformal SpinSpin-manifolds (M,[h])(M,[h]) and their Poincaré-Einstein metrics (X,g+)(X,g_+). Our approach is based on the spectral theory of Dirac operator in the ambient SpinSpin-manifold, and associated spinor valued meromorp…

2014-02-03abs ↗pdf ↗

Our research proves neural collapse in deep ResNets and transformers is globally optimal.

problem Understanding neural collapse in deep learning models.
method Analysis of deep regularized transformers and ResNets trained with cross entropy or mean squared error loss.
result Global optima of deep regularized transformers and ResNets are approximately collapsed, becoming more prominent as depth increases.

Vision Transformers show different internal representations compared to CNNs.

problem Understanding how Vision Transformers solve image classification tasks.
method Comparative analysis of ViT and CNN architectures on image classification benchmarks.
result ViT has more uniform representations across all layers, while CNNs have more varied representations.

Layer normalization placement affects training stability and warm-up stage necessity.

problem Training instability and the necessity of a learning rate warm-up stage in Transformers.
method Theoretical analysis and mean field theory to prove gradient behavior at initialization.
result Removing the warm-up stage for Pre-LN Transformers can achieve comparable results with less time and tuning.

Study on knot 747_4 surgeries reveals infinite residue characteristics and infinite order points.

problem Arithmetic properties of Dehn surgery points on knot 747_4.
method Analyzing the canonical component of the SL2(C)\mathrm{SL}_2(\mathbf{C})-character variety.
result Infinite set of ramified places and infinite order points in the Mordell-Weil group.

Filters in convolutional networks are typically parameterized in a pixel basis, that does not take prior knowledge about the visual world into account. We investigate the generalized notion of frames designed with image properties in mind, as alternatives to this parametrization. We show that frame-based ResNets and De…

2017-06-02abs ↗pdf ↗

Consider the space RΔR_Δ of rational functions of several variables with poles on a fixed arrangement ΔΔ of hyperplanes. We obtain a decomposition of RΔR_Δ as a module over the ring of differential operators with constant coefficients. We generalize to the space RΔR_Δ the notions of principal part and of residue, and …

1999-03-30abs ↗pdf ↗

Residual networks with depthwise hyperparameter scaling transfer optimal hyperparameters across width and depth.

problem The challenge of hyperparameter tuning in deep learning, especially for large models.
method Combining μμP parameterization with residual networks having a residual branch scale of 1/extdepth1/\sqrt{ ext{depth}}.
result Optimal hyperparameters transfer across width and depth in residual networks trained with this parameterization.

An emerging design principle in deep learning is that each layer of a deep artificial neural network should be able to easily express the identity transformation. This idea not only motivated various normalization techniques, such as \emph{batch normalization}, but was also key to the immense success of \emph{residual …

2016-11-14abs ↗pdf ↗

Residual networks' depth is mathematically equivalent to expanding an implicit ensemble size.

problem Understanding why deep residual networks are effective.
method Formal analysis of residual networks as ensembles of shallow models.
result Increasing network depth is equivalent to expanding the size of an implicit ensemble, revealing a hierarchical structure.

In this effort, we propose a new deep architecture utilizing residual blocks inspired by implicit discretization schemes. As opposed to the standard feed-forward networks, the outputs of the proposed implicit residual blocks are defined as the fixed points of the appropriately chosen nonlinear transformations. We show …

2019-05-24abs ↗pdf ↗

CAM-GAN improves GANs for continual learning with efficient feature map transformations.

problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.

Unified spectral framework for μP under joint width-depth scaling.

problem Challenges in stable feature learning and HP transfer for width-depth scaled models.
method Developed a simple and unified spectral framework for μP under joint width-depth scaling.
result Unified and generalized μP formulation for practical architectures with multi-transformation branches.

The paper establishes a Poisson Poincaré-Dulac theorem for Poisson-flat connections.

problem Analyzing Poisson-flat connections with logarithmic poles.
method Defining an Euler-Poisson principal part and residue theory, establishing a Poisson Poincaré-Dulac theorem.
result Any logarithmic Poisson-flat connection is holomorphically gauge equivalent to a pure Euler-Poisson normal form.

CRC improves multivariate forecasting accuracy without risking performance degradation.

problem Systematic errors and lack of guarantees in multivariate forecasters.
method CRC uses a causality-inspired encoder and hybrid corrector with a safety mechanism.
result CRC consistently improves accuracy and ensures high non-degradation rates.

New theory explains signal propagation in normalization-free transformers.

problem Understanding signal propagation in normalization-free transformers.
method Deriving recurrence relations for activation statistics and APJNs across layers.
result Transformers with elementwise tanh-like nonlinearities exhibit subcritical signal propagation.

Improved DNN calibration without sacrificing accuracy.

problem Poor calibration of over-parametrized DNNs in safety-critical applications.
method Decoupling feature extraction and classification layers, and applying Gaussian priors.
result Significant improvement in model calibration with minimal training cost.

LLapDiff models irregular multivariate time series without step-by-step integration.

problem Trade-off between discrete and continuous methods for long-horizon forecasting.
method Generative framework that models target as a low-dimensional latent trajectory, guided by modal parameterization and Laplace domain poles.
result Improves long-horizon forecasting over baselines and supports missing-value imputation.

Let G be a torsion free discrete group and let \bar{Q} denote the field of algebraic numbers in C. We prove that \bar{Q}[G] fulfills the Atiyah conjecture if G lies in a certain class of groups D, which contains in particular all groups which are residually torsion free elementary amenable or which are residually free.…

2001-07-06abs ↗pdf ↗