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

12243547 · Jun 202019922001200920172026
48 results for 1D interpolation

Ridgeless ReLU networks interpolate datasets and extrapolate based on curvature signs.

problem Interpolating and extrapolating 1D datasets with ReLU networks.
method Minimizes 2\ell_2-norm of weights, extrapolates based on curvature signs.
result Ridgeless ReLU interpolants extrapolate as nearest neighbor curvature extrapolation.

Paper proposes a method to reduce hallucinations in diffusion models using Laplacian score sharpening.

problem Hallucinations in diffusion models create incoherent or unrealistic samples.
method Post-hoc adjustment to the score function during inference using Laplacian approximation.
result Significantly reduces the rate of hallucinated samples across various data types.

New method uses neural networks to interpolate stellar atmospheres with high precision.

problem Recover precise stellar model atmospheres from grids of models.
method Deep neural network with 1D convolutional auto-encoder for feature extraction.
result Higher precision compared to traditional methods.

Simulating fluid flow in geological formations requires mesh generation, lithology mapping to the cells, and computing geometric properties such as normal vectors and volume of cells. The purpose of this research work is to compute and process the geometrical information required for performing numerical simulations in…

2006-07-17abs ↗pdf ↗

Machine learning is used to approximate density functionals. For the model problem of the kinetic energy of non-interacting fermions in 1d, mean absolute errors below 1 kcal/mol on test densities similar to the training set are reached with fewer than 100 training densities. A predictor identifies if a test density is …

2011-12-22abs ↗pdf ↗

FDN improves probabilistic regressors' adaptability to distribution shifts.

problem Overconfidence in modern probabilistic regressors under distribution shift.
method FDN uses input-conditioned distributions over network weights, trained with a Monte Carlo beta-ELBO objective.
result FDN produces predictive mixtures whose dispersion adapts to the input, providing shift-aware uncertainty.

Improved robustness of 1D CNNs for heart arrhythmia classification.

problem Improving the robustness of 1D CNNs for classification tasks.
method Parameterization using Cayley transform and controllability Gramian for Lipschitz-bounded CNNs.
result Improved robustness of trained Lipschitz-bounded 1D CNNs for heart arrhythmia classification.

Split learning preserves privacy in 1D CNN models for detecting heart abnormalities.

problem Privacy leakage in 1D CNN models under split learning.
method Implemented and validated an 1D CNN model under split learning, applied privacy leakage mitigation techniques.
result Split learning alone is insufficient to maintain raw data privacy in 1D CNN models.

SKI speeds up Toeplitz Neural Networks by avoiding explicit decay bias and using frequency response.

problem Efficiently compute and update Toeplitz matrices in neural networks.
method Sparse plus low-rank decomposition, asymmetric SKI, frequency response modeling.
result Achieved significant speedup with minimal performance loss.

Gradient descent trains shallow neural networks to approximate functions in 1D.

problem Approximating functions in 1D with shallow neural networks trained by gradient descent.
method Gradient descent optimization of non-convex weight space for finite width networks in 1D.
result Gradient descent can approximate functions in 1D with a minimal number of weights, balancing practical performance and theoretical capabilities.

Study on the complexity of 1D ReLU neural networks, proving growth in linear regions.

problem Understanding the complexity and expressivity of 1D ReLU neural networks.
method Analyzing the number of linear regions in randomly initialized, fully connected 1D ReLU networks in the infinite-width limit.
result The expected number of linear regions grows as a function of the number of neurons in each layer.

Study shows how 3+1D cosmologies can evolve to de Sitter space under certain conditions.

problem Understanding the evolution of 3+1D cosmologies with specific symmetry constraints.
method Mean Curvature Flow methods applied to cosmologies with positive cosmological constant and specific symmetry groups.
result Asymptotically, 3+1D cosmologies evolve to de Sitter space under certain conditions.

Estimates reliability of nuclear fuel using advanced modeling techniques.

problem Determining the reliability of TRISO-coated particle fuel, which has small failure probabilities and expensive computational models.
method Coupled active learning, multifidelity modeling, and subset simulation.
result Multifidelity modeling strategies consistently reduce the number of high-fidelity model calls.

REGS samples from unnormalized distributions using gradient flow and neural networks.

problem Sampling from unnormalized distributions with high accuracy and efficiency.
method REGS is a particle method that iteratively transforms samples from a reference distribution to match an unnormalized target distribution using Wasserstein gradient flow and neural networks.
result REGS outperforms state-of-the-art methods in sampling from challenging multimodal distributions and real datasets.

Study shows inflation in 3+1D cosmologies with bounded scalar potential and specific symmetry.

problem Understanding inflation in 3+1D cosmologies with specific constraints.
method Mean curvature flow and asymptotic analysis of metric variations, stress-energy tensor, and inflaton field dynamics.
result Inflation occurs in 3+1D cosmologies with specific constraints, demonstrating it is possible with inhomogeneous initial conditions.

Estimates latent positions in 1D torus from noisy pairwise affinities.

problem Estimating latent positions in a 1D torus from noisy pairwise affinities.
method Introduced an estimation procedure with provable localization error of O(log(n)/n)O(\sqrt{\log(n)/n}).
result The estimation procedure provably localizes latent positions with a maximum error of O(log(n)/n)O(\sqrt{\log(n)/n}).

This study analyzes a non-orientable spacetime model in 1+1D quantum gravity.

problem Analyzing a non-orientable spacetime model in 1+1D quantum gravity.
method Formulated a Jackiw-Teitelboim gravity toy model on the Möbius band, computed Stiefel-Whitney classes, and analyzed the Dirac operator.
result Half-integer momentum quantization, spectral symmetry, vanishing mod-2 index, and η_D(0) = 0 follow.

Capsule networks excel in understanding spatial relationships in 2D data for vision related tasks. Even though they are not designed to capture 1D temporal relationships, with TimeCaps we demonstrate that given the ability, capsule networks excel in understanding temporal relationships. To this end, we generate capsule…

2019-11-26abs ↗pdf ↗

Study no-arbitrage conditions in 1D diffusion markets with interest rates.

problem Determining no-arbitrage conditions in 1D diffusion markets with interest rates.
method Established deterministic criteria for no-arbitrage notions in terms of scale function and speed measure.
result Revealed various effects, e.g., NIP not excluded by reflecting boundaries.

New method trains generative models without discriminators, improving stability and accuracy.

problem Training implicit generative models with adversarial discriminators leads to instability and mode-dropping.
method Invariant statistical loss function, avoiding discriminators.
result Successfully trains generative models for various complex distributions without mode-dropping.

A simple block configures optimal kernel sizes for time series classification.

problem Choosing the right kernel size for time series classification.
method Proposes Omni-Scale block (OS-block) with kernel sizes determined by prime numbers.
result Models with OS-block achieve state-of-the-art performance on time series benchmarks.

This paper shows how forward rate interpolations are equivalent to discount factor interpolations in yield curve construction.

problem The challenge of choosing between different interpolation methods for yield curve construction.
method Demonstrates the equivalence between forward rate interpolations and discount factor interpolations.
result Some popular interpolation methods on forward rates are equivalent to classical interpolation methods on discount factors.

The paper proposes an ensemble of convolution-based methods for fault detection in gearboxes.

problem Fault detection in planetary gearboxes using vibration signals.
method Ensemble of three convolution kernel-based methods (ROCKET, 1D CNN with ResNet, FCN).
result Outperforms other approaches with over 98.8% accuracy.

In this paper, we introduce an inclined curves according to parallel transport frame. Also, we define a vector field called Darboux vector field of an inclined curve in and we give a new characterization such as: "α: I \subset R \rightarrow E^4 is an inclined curve \Leftrightarrow k_1 \int k_1ds + k_2 \int \k_2 +k_3ds …

2013-03-29abs ↗pdf ↗

The author studies regions foliated by 1D families of functions and their applications.

problem Understanding regions represented as foliated forms and natural smooth maps onto them.
method Investigates natural smooth maps respecting canonical projections and moment maps, focusing on foliated regions.
result Discusses the 1st derivative of functions and critical sets in foliated regions.

The paper proposes a method for generating uniform interpolations on data manifolds.

problem Generating high-quality interpolations between data samples on complex manifolds.
method Autoencoder network with interpolation network, regularized by a Riemannian metric.
result The method generates interpolations that remain within the manifold's distribution.

Deep neural networks continue to show improved performance with increasing depth, an encouraging trend that implies an explosion in the possible permutations of network architectures and hyperparameters for which there is little intuitive guidance. To address this increasing complexity, we propose Evolutionary DEep Net…

2017-09-26abs ↗pdf ↗

Near-interpolating models grow norms quickly, affecting generalization.

problem Understanding the trade-off between interpolation and generalization in near-interpolating models.
method Random matrix theory and eigendecay analysis of data covariance matrix.
result Near-interpolating models exhibit rapid norm growth and worse generalization trade-offs.

Deep neural networks can interpolate any dataset in the overparametrized regime.

problem Interpolating any dataset with deep neural networks in the overparametrized regime.
method Proving universal approximations and interpolating any dataset with deep neural networks, considering specific conditions on activation functions.
result Interpolation of any dataset is possible in the overparametrized regime with deep neural networks.