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

265379105 · Jun 202019922001200920172026
48 results for one-dimensional fitting

Sliced kernelized Stein discrepancy improves goodness-of-fit tests and model learning in high dimensions.

problem The curse-of-dimensionality in kernelized Stein discrepancy (KSD).
method Sliced Stein discrepancy and its scalable variants using optimal one-dimensional projections.
result Significantly outperforms KSD and baselines in goodness-of-fit tests and improves model learning.

A new method calibrates value predictions in offline RL to improve reliability.

problem Difficulty in long-horizon value prediction in offline reinforcement learning.
method Bellman calibration, a weak reliability criterion, and Iterated Bellman Calibration.
result Finite-sample guarantees show that Bellman calibration error is controlled at nonparametric rates.

We study the problem of variable selection in convex nonparametric regression. Under the assumption that the true regression function is convex and sparse, we develop a screening procedure to select a subset of variables that contains the relevant variables. Our approach is a two-stage quadratic programming method that…

2014-11-07abs ↗pdf ↗

The study examines different types of equilibria for stopping problems in one-dimensional diffusion processes.

problem Characterizing and comparing different types of equilibria for time-inconsistent stopping problems.
method Analyzes log sub-additive discount functions and one-dimensional diffusion processes to derive necessary and sufficient conditions for weak equilibria and other types of equilibria.
result Conditions for weak equilibria and their implications for other types of equilibria are provided.

A new method approximates expected empirical loss for stochastic deep learning tasks.

problem Determining optimal step sizes for stochastic gradient descent in deep learning.
method Applying one-dimensional function fitting to noisy losses of vertical cross sections to approximate expected empirical loss.
result The method leads to a robust and straightforward optimization method that performs well across datasets and architectures.

We extend the Deep Image Prior (DIP) framework to one-dimensional signals. DIP is using a randomly initialized convolutional neural network (CNN) to solve linear inverse problems by optimizing over weights to fit the observed measurements. Our main finding is that properly tuned one-dimensional convolutional architectu…

2019-04-18abs ↗pdf ↗

Push-forward models struggle to fit multimodal distributions due to high Lipschitz constants.

problem Expressivity of push-forward generative models in fitting multimodal distributions.
method Analyzing the Lipschitz constant and its relation to the total variation distance and Kullback-Leibler divergence.
result Push-forward models require high Lipschitz constants to approximate multimodal distributions, leading to a trade-off between expressivity and stability.

Study one-dimensional topological theories with linear generating functions.

problem Understanding one-dimensional topological theories with defects.
method Construct bases of hom spaces for decorated unoriented one-dimensional cobordisms.
result Gram determinant and linear generating functions constructed.

Matrix Product States (MPS), also known as Tensor Train (TT) decomposition in mathematics, has been proposed originally for describing an (especially one-dimensional) quantum system, and recently has found applications in various applications such as compressing high-dimensional data, supervised kernel linear classifie…

2018-12-13abs ↗pdf ↗

Deep heteroskedastic models overfit, showing a phase transition with regularization strength.

problem Overfitting in deep heteroskedastic regression models.
method Theoretical framework based on statistical field theory, empirical verification, and hyperparameter simplification.
result A phase transition in model behavior with varying regularization strength.

Study of one-dimensional non-Hausdorff manifolds and their quotient to CW complexes.

problem Understanding and characterizing one-dimensional non-Hausdorff manifolds.
method Analyzing properties of connected non-Hausdorff manifolds and their quotient spaces to CW complexes.
result Existence of a quotient map from a connected non-Hausdorff manifold to an open one-dimensional CW complex.

Study reveals structure of local minima in GMMs, identifying key cluster centers.

problem Identifying optimal cluster centers in non-convex GMM landscapes.
method Analyzing the negative log-likelihood function of GMMs in the population limit.
result Local minima share a common structure that partially identifies true cluster centers.

We prove that for compact, non-contractible, one dimensional geodesic spaces, a version of the marked length spectrum conjecture holds. For a compact one dimensional geodesic space X, we define a subspace Conv(X). When X is non-contractible, we show that X deformation retracts to Conv(X). If two such spaces X, Y have t…

2012-09-17abs ↗pdf ↗

We present a novel Neural Embedding Spatio-Temporal (NEST) point process model for spatio-temporal discrete event data and develop an efficient imitation learning (a type of reinforcement learning) based approach for model fitting. Despite the rapid development of one-dimensional temporal point processes for discrete e…

2019-06-13abs ↗pdf ↗

In this paper we focus on the problem of assigning uncertainties to single-point predictions. We introduce a cost function that encodes the trade-off between accuracy and reliability in probabilistic forecast. We derive analytic formula for the case of forecasts of continuous scalar variables expressed in terms of Gaus…

2018-03-12abs ↗pdf ↗

It is generally understood that a given one-dimensional diffusion may be transformed by Cameron-Martin-Girsanov measure change into another one-dimensional diffusion with the same volatility but a different drift. But to achieve this we have to know that the change-of-measure local martingale that we write down is a tr…

2019-10-25abs ↗pdf ↗

In this paper we continue our studies of the one dimensional conformal metric flows, which were introduced in [8]. In this part we mainly focus on evolution equations involving fourth order derivatives. The global existence and exponential convergence of metrics for the 1-Q and 4-Q flows are obtained.

2007-10-23abs ↗pdf ↗

Geometric Occam's Razor shapes deep learning solutions.

problem Understanding the regularization in over-parameterized neural networks.
method Analyzing the geometric model complexity and Dirichlet energy in neural networks.
result Over-parameterized neural networks are implicitly regularized by geometric model complexity.

Combines machine learning and convex limiting for accurate subgrid flux modeling in shallow-water equations.

problem Accurate subgrid flux modeling in shallow-water equations.
method Machine learning and flux limiting for property-preserving subgrid scale modeling.
result The proposed method produces meaningful closures even in untrained scenarios.

Proposes a new regression method using LpL_p-norms for non-Gaussian noise.

problem Non-Gaussian noise in residuals affects the performance of local least squares regression.
method Introduces local polynomial LpL_p-norm regression, replacing weighted least squares with weighted LpL_p-norm estimation.
result Demonstrates superior performance over local least squares in one-dimensional data and higher dimensions.

Study shows one-dimensional location-scale-shape models are flat in Wasserstein geometry.

problem Investigating curvature in location-scale-shape models under Wasserstein metric.
method Introduced location-scale-shape model and investigated its geometry.
result Location-scale-shape model is intrinsically flat but extrinsically curved in Wasserstein geometry.

This paper optimizes Gaussian mixture model learning with optimal sampling complexity.

problem Learning the number of components and mixing distribution in 1D Gaussian mixtures.
method Fourier-based approach to estimate model order and mixing distribution.
result The proposed method matches the optimal sampling complexity and outperforms conventional techniques.

The paper analyzes how the one-dimensional Wasserstein distance captures pointwise density differences in finite samples.

problem Uncertainty in identifying density differences when supports overlap and densities have substantial pointwise differences.
method Analysis using the Poisson process and neural spike train decoding.
result The one-dimensional Wasserstein distance highlights meaningful density differences related to both rate and support.

Proposes a new method for two-dimensional data discretization.

problem Discretization of multi-dimensional data, especially when dimensions are dependent.
method PALM algorithm, which alternately partitions and merges regions using the MDL principle.
result PALM accurately reveals ground truth partitions and approximates well outside the model class.

Any two compact, complete, one-dimensional geodesic spaces with identical marked length spectrum have isometric π1π_1-hull. The present version contains errors, notably in Lemmas 2.2 and 2.3 (path cancellations can be more complicated), which then propagate through the paper. The main result is correct as stated, and a…

2003-01-26abs ↗pdf ↗

We prove that every homomorphism from the fundamental group of a planar Peano continuum to the fundamental group of a planar or one-dimensional Peano continuum is induced by a continuous map up to conjugation. This is then used to provide a family of uncountable many planar Peano continua with pairwise non-isomorphic f…

2013-05-18abs ↗pdf ↗

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.

Using the one dimensional free particle symmetries, the quantum finance symmetries are obtained. Namely, it is shown that Black-Scholes equation is invariant under Schrödinger group. In order to do this, the one dimensional free non-relativistic particle and its symmetries are revisited. To get the Black-Scholes equati…

2013-04-18abs ↗pdf ↗

We assess cluster stability by trimming extreme points and tracking data range reduction.

problem Assessing stability of one-dimensional clusters.
method Probabilistic method using diameter-shrinkage ratio to track data range reduction.
result Our method achieves higher accuracy than classical tests in small or noisy samples.