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

Trend · papers per month

6491,2991,9482,597 · Jun 202019922001200920172026
48 results for 1D families of functions

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.

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 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.

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.

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.

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.

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}).

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 ↗

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 extends sparse alternatives to softmax for continuous domains, enabling efficient attention mechanisms.

problem Efficiently assigning zero probability to irrelevant categories in continuous domains.
method Extend alpha-entmax to continuous domains, introducing continuous-domain attention mechanisms.
result Continuous attention allows attending to time intervals and compact regions, improving text classification, machine translation, and visual question answering.

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.

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.

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.

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 ↗

SCORE technique reduces BO's high-dimensional search costs.

problem Bayesian optimization's high computational costs in high-dimensional spaces.
method 1D reparametrization trick to maintain linear time complexity.
result Successfully finds global minimum in high-dimensional optimization.

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.

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.

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.

The paper studies a 1D diffusion equation with nonlinear Robin boundary conditions and finds conditions for global and finite time blow-up or blow-down.

problem Investigating the behavior of solutions to a specific diffusion equation with nonlinear Robin boundary conditions.
method Analyzing the Ricci flow on a cylinder and applying it to the diffusion equation.
result Conditions for global and finite time blow-up or blow-down of solutions.

Linear RNNs exhibit a bias towards shorter memory due to initialization variance.

problem Understanding the performance limitations of RNNs, especially linear ones.
method Kernel regime analysis to show equivalence to 1D-convolutional networks and analyze weightings.
result Linear RNNs with random initialization have a bias towards shorter memory periods.

We demonstrate the existence of universal adversarial perturbations, which can fool a family of audio classification architectures, for both targeted and untargeted attack scenarios. We propose two methods for finding such perturbations. The first method is based on an iterative, greedy approach that is well-known in c…

2019-08-08abs ↗pdf ↗

NTS-NOTEARS learns DBNs from time-series data with prior knowledge.

problem Learning dynamic Bayesian networks from time-series data with nonlinear and lagged relationships.
method Uses 1D CNNs to model DBNs, incorporating prior knowledge as constraints.
result Achieves state-of-the-art DAG structure quality compared to parametric and nonparametric methods.

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.

Calibrating a Lévy process usually requires characterizing its jump distribution. Traditionally this problem can be solved with nonparametric estimation using the empirical characteristic functions (ECF), assuming certain regularity, and results to date are mostly in 1D. For multivariate Lévy processes and less smooth …

2018-12-20abs ↗pdf ↗

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.

Capsule networks improve temporal data understanding, achieving 96.21% ECG accuracy.

problem Improving temporal data understanding with capsule networks.
method Generated capsules along temporal and channel dimensions, learning contrasting relationships.
result Achieved 96.21% accuracy on ECG signal beat categories, surpassing state-of-the-art.

Supervised dimensionality reduction has emerged as an important theme in the last decade. Despite the plethora of models and formulations, there is a lack of a simple model which aims to project the set of patterns into a space defined by the classes (or categories). To this end, we set up a model in which each class i…

2016-10-27abs ↗pdf ↗

Proposes SD-KDE for density estimation using debiased kernel density with score-based adjustments.

problem Density estimation with bias in kernel density estimation.
method Adjusts data points by taking a step along the estimated score function, then applies standard KDE with modified bandwidth.
result Significantly reduces mean integrated squared error compared to standard Silverman KDE, especially with noisy score function estimates.

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 ↗