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

306090120 · Jun 202019922001200920172026
48 results for Short-range interactions

Study finds phase transition in context-sensitive language model with short-range interactions.

problem Understanding phase transitions in language models with short-range interactions.
method Constructed a random language model with short-range interactions and investigated its statistical properties.
result Phase transition occurs in context-sensitive language models with constant context length.

New perspective on SGD reveals short-range memory effects in deep learning.

problem Understanding the efficacy of stochastic gradient descent (SGD) in deep learning.
method Proposed that SGD is a discretization of an SDE driven by fractional Brownian motion (FBM).
result SGD stays longer in flat minima, favoring generalization.

TSLANet improves time series models by capturing long-term and short-term interactions.

problem Noise sensitivity, computational efficiency, and overfitting in Transformer-based models for time series data.
method Adaptive Spectral Block and Interactive Convolution Block for robust feature representation and noise mitigation.
result TSLANet outperforms state-of-the-art models in various time series tasks.

The problem of recovering the asymptotics of a short range perturbation of the Euclidean metric on R^n from fixed energy scattering data is studied. It is shown that if two such metrics, g1, g2, have scattering data at some fixed energy which are equal up to smoothing, then there exists a diffeomorphism ψ`fixing infini…

1997-10-31abs ↗pdf ↗

Proves energy expression on Poincaré-Einstein spaces.

problem Computing renormalized Yang-Mills energy on Poincaré-Einstein manifolds.
method Generalizes Chang-Qing-Yang method for renormalized volumes and uses scattering theory for Schrödinger operators.
result Agrees with anomaly boundary integrand in seven dimensions.

Study evaluates neural networks based on random graph structures and finds key performance indicators.

problem Understanding and optimizing neural network architectures using graph theory.
method Evaluation of neural networks with random graph structures, focusing on structural and numerical properties.
result A new numerical graph characteristic selects a set of quasi-1-dimensional graphs that perform well.

Develops a nonlocal PINN framework using PDDO for better solution of PDEs with sharp gradients.

problem Dealing with sharp gradients in solutions of PDEs using traditional PINN approaches.
method Integrates long-range interactions (nonlocality) into PINN using Peridynamic Differential Operator (PDDO).
result Nonlocal PINN approach improves solution accuracy and parameter inference for problems with sharp gradients.

A multi-scale model predicts atomic-scale properties using both local and long-range information.

problem Inability of machine-learning schemes to capture long-range physical effects.
method Combines local and non-local information in a multipole expansion framework.
result Demonstrates the ability to model electrostatics, polarization, and dispersion.

A new machine learning method for spatial regression.

problem Spatial/temporal regression with scattered data and arbitrary dimensions.
method Modified Planar Rotator (MPRS) method, a non-parametric model with distance-dependent interactions.
result MPRS predictions are competitive with standard interpolation methods and superior in handling rough and non-Gaussian data.

Proposes a framework to incorporate global sensitivity into local surrogate models.

problem Narrowing focus to local scale in surrogate modeling leads to re-learning global trends.
method Integrates global sensitivity analysis into local surrogate models through input warping.
result Local models become equally sensitive to all input directions, focusing on local dynamics.

We present a modification of the so-called Parrondo's paradox where one is allowed to choose in each turn the game that a large number of individuals play. It turns out that, by choosing the game which gives the highest average earnings at each step, one ends up with systematic loses, whereas a periodic or random seque…

2002-12-16abs ↗pdf ↗

V1 cortex reconstructs images as Poisson equation solutions with varying weights.

problem Reconstructing images from V1 cortical cell receptive profiles.
method Solves a heterogeneous Poisson equation with varying weights representing neural connectivity.
result Reconstructions converge to homogeneous solutions using homogenization techniques.

In this paper we consider certain asymptotically Euclidean spaces, namely compact manifolds with boundary X equipped with a scattering metric g, as defined by Melrose. We then consider Hamiltonians H which are `short-range' self-adjoint perturbations of the Laplacian of g. Melrose and Zworski have given a detailed desc…

1999-06-29abs ↗pdf ↗

Convolutional neural networks are commonly used to control the steering angle for autonomous cars. Most of the time, multiple long range cameras are used to generate lateral failure cases. In this paper we present a novel model to generate this data and label augmentation using only one short range fisheye camera. We p…

2018-08-20abs ↗pdf ↗

We propose a Standing Wave Decomposition (SWD) approximation to Gaussian Process regression (GP). GP involves a costly matrix inversion operation, which limits applicability to large data analysis. For an input space that can be approximated by a grid and when correlations among data are short-ranged, the kernel matrix…

2018-03-09abs ↗pdf ↗

We introduce a general framework of the Mixed-correlated ARFIMA (MC-ARFIMA) processes which allows for various specifications of univariate and bivariate long-term memory. Apart from a standard case when Hxy=12(Hx+Hy)H_{xy}={1}{2}(H_x+H_y), MC-ARFIMA also allows for processes with Hxy<12(Hx+Hy)H_{xy}<{1}{2}(H_x+H_y) but also for long-range …

2013-07-23abs ↗pdf ↗

The paper analyzes time-dependent streaming data with biased gradient estimates and proposes improved stochastic optimization methods.

problem Stochastic optimization in a streaming setting with time-dependent and biased gradient estimates.
method Analysis of several first-order methods including SGD, mini-batch SGD, and time-varying mini-batch SGD, along with their Polyak-Ruppert averages.
result Time-varying mini-batch SGD methods can break long- and short-range dependence structures, and biased SGD methods can achieve comparable performance to their unbiased counterparts.

Autoregressive networks can achieve promising performance in many sequence modeling tasks with short-range dependence. However, when handling high-dimensional inputs and outputs, the huge amount of parameters in the network lead to expensive computational cost and low learning efficiency. The problem can be alleviated …

2019-09-06abs ↗pdf ↗

We analyze the resolvent R(k)=(P+k2)1R(k)=(P+k^2)^{-1} of Schrödinger operators P=Δ+VP=Δ+V with short range potential VV on asymptotically conic manifolds (M,g)(M,g) (this setting includes asymptotically Euclidean manifolds) near k=0k=0. We make the assumption that the dimension is greater or equal to 3 and that PP has no L2L^2 null …

2007-01-18abs ↗pdf ↗

Framework isolates causal effects from time series data, improving accuracy under non-stationarity and autocorrelation.

problem Causal inference in non-stationary, autocorrelated time series data.
method Decomposes time series into trend, seasonal, and residual components; performs component-specific causal analysis.
result Framework more accurately recovers ground-truth causal structure than state-of-the-art baselines, especially under strong non-stationarity and temporal autocorrelation.

Vector autoregression (VAR) is a fundamental tool for modeling multivariate time series. However, as the number of component series is increased, the VAR model becomes overparameterized. Several authors have addressed this issue by incorporating regularized approaches, such as the lasso in VAR estimation. Traditional a…

2014-12-17abs ↗pdf ↗

Embed-KCPD segments text without labels, outperforming baselines.

problem Unsupervised text segmentation is challenging due to lack of boundary labels.
method Embed-KCPD represents sentences as embeddings and estimates boundaries via penalized KCPD.
result Embed-KCPD outperforms strong unsupervised baselines across benchmarks.

Paper develops Dense NN models for temporal-spatial data with improved performance.

problem Improving predictive performance and robustness in temporal-spatial modeling.
method Fully connected neural networks with ReLU activation, non-asymptotic bounds, manifold modeling, short-range dependence.
result Demonstrates superior performance in temporal-spatial modeling across various synthetic functions.

Develops privacy-preserving methods for longitudinal linear regression.

problem Protecting individual information in longitudinal data with privacy-preserving statistics.
method Proposes a user-level private regression estimator and a privatized covariance estimator for longitudinal linear regression under user-level differential privacy.
result Establishes theoretical guarantees for practical user-level differential privacy estimation and inference in longitudinal linear regression.

Recent empirical studies suggest that the volatilities associated with financial time series exhibit short-range correlations. This entails that the volatility process is very rough and its autocorrelation exhibits sharp decay at the origin. Another classic stylistic feature often assumed for the volatility is that it …

2017-06-29abs ↗pdf ↗

We present a novel method for hierarchical topic detection where topics are obtained by clustering documents in multiple ways. Specifically, we model document collections using a class of graphical models called hierarchical latent tree models (HLTMs). The variables at the bottom level of an HLTM are observed binary va…

2016-05-21abs ↗pdf ↗

Generative adversarial network improves audio inpainting for long gaps.

problem Generating missing audio content in long-range gaps using WGAN.
method Proposed WGAN architecture with short-range and long-range neighboring borders.
result The proposed model outperforms classical WGAN in reconstructing high-frequency content.

Factorization Machine (FM) is a widely used supervised learning approach by effectively modeling of feature interactions. Despite the successful application of FM and its many deep learning variants, treating every feature interaction fairly may degrade the performance. For example, the interactions of a useless featur…

2019-02-26abs ↗pdf ↗

Study analyzes low-energy behavior of Schrödinger operators with Coulomb potentials.

problem Analyzing the limiting resolvent of Schrödinger operators at low energies.
method Using Vasy's second microlocal approach (Lagrangian approach), uniformly analyzing the resolvent from E=0E=0.
result Obtained oscillatory asymptotics for the resolvent output at low energy, differing from short-range cases.

We consider Markov models of stochastic processes where the next-step conditional distribution is defined by a kernel density estimator (KDE), similar to Markov forecast densities and certain time-series bootstrap schemes. The KDE Markov models (KDE-MMs) we discuss are nonlinear, nonparametric, fully probabilistic repr…

2018-07-30abs ↗pdf ↗

Bayesian Complementary Kernelized Learning models complex spatiotemporal data.

problem Modeling complex, nonstationary, and nonseparable spatiotemporal data.
method Integrates kernelized low-rank tensor factorization and short-range spatiotemporal Gaussian Processes.
result BCKL offers superior performance in providing accurate posterior mean and high-quality uncertainty estimates.

A new method detects interactions in neural networks using topological analysis.

problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.

iKF method uncovers complex variable interactions for scientific discovery.

problem Limited interpretability of existing models in decision-making applications.
method Iterative Kings' Forests (iKF) method to uncover multi-order interactions.
result iKF provides strong interpretive power for explainable modeling.