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

201402603804 · Jun 202019922001200920172026
48 results for truncated value functions

New kernels capture both local and non-local interactions efficiently.

problem Designing kernels that capture both local and non-local interactions while remaining computationally tractable.
method Spectral truncation kernels based on CC^*-algebra.
result Spectral truncation kernels induce interactions across the data function domain and reduce computational cost.

In the paper "On Truncated Variation of Brownian Motion with Drift" (Bull. Pol. Acad. Sci. Math. 56 (2008), no.4, 267 - 281) we defined truncated variation of Brownian motion with drift, Wt=Bt+μt,t0,W_t = B_t + μt, t\geq 0, where (Bt)(B_t) is a standard Brownian motion. Truncated variation differs from regular variation by neglect…

2009-12-23abs ↗pdf ↗

New method evaluates personalized treatment in critical care, robust to death.

problem Truncation by death in critical care makes traditional DTR evaluation ineffective.
method Principal stratification-based approach, focusing on always-survivor value function, with a semiparametrically efficient, multiply robust estimator.
result Demonstrates robustness and efficiency of the method for personalized treatment optimization.

We introduce a dynamic credit portfolio framework where optimal investment strategies are robust against misspecifications of the reference credit model. The risk-averse investor models his fear of credit risk misspecification by considering a set of plausible alternatives whose expected log likelihood ratios are penal…

2016-03-27abs ↗pdf ↗

State construction is important for learning in partially observable environments. A general purpose strategy for state construction is to learn the state update using a Recurrent Neural Network (RNN), which updates the internal state using the current internal state and the most recent observation. This internal state…

2018-07-18abs ↗pdf ↗

TKRR improves KRR performance by aligning target functions with kernels.

problem Improving kernel ridge regression performance through target alignment.
method Focuses on truncated kernel ridge regression (TKRR) with an additional spectral truncation parameter.
result TKRR can achieve faster rates than full KRR, reaching parametric rates.

The positivity assumption, or the experimental treatment assignment (ETA) assumption, is important for identifiability in causal inference. Even if the positivity assumption holds, practical violations of this assumption may jeopardize the finite sample performance of the causal estimator. One of the consequences of pr…

2017-07-18abs ↗pdf ↗

Paper proposes approximate Stein classes for efficient truncated density estimation.

problem Difficulties in estimating truncated density models due to intractable normalising constants and boundary conditions.
method Adapts score matching to solve the problem, introduces approximate Stein classes and a novel discrepancy measure, TKSD.
result TKSD does not require a fixed weighting function and can be evaluated using only boundary samples, leading to improved accuracy.

Score matching method improves density estimation for truncated data on manifolds.

problem Density estimation for truncated data on manifolds with intractable normalising constant.
method Truncated score matching extended to Riemannian manifolds with boundary.
result Score matching estimator approximates true parameter values with low error.

The paper investigates the convergence of Vendi scores under finite samples and introduces a truncated version for better performance.

problem The Vendi score's convergence is hindered by computational limitations when using large sample sizes.
method The authors introduce the t-truncated Vendi score to address this issue by truncating the eigenspectrum of the kernel matrix.
result The t-truncated Vendi score converges to its asymptotic limit with a smaller number of samples, improving upon the standard Vendi score.

Extended univariate Range Value-at-Risk to multivariate settings.

problem Inability of traditional risk measures for heavy-tail distributions and infinite tail expectations.
method Multivariate definitions of robust truncated tail expectations, robustness and properties derived, closed-form expressions and special cases discussed.
result Empirical estimators accuracy examined through numerical and graphical examples.

Continuing the previous work, we propose a further extension of the structure equation for a truncated CMC hierarchy by the non-commuting, truncated Virasoro algebra of non-local symmetries. Via a canonical dressing transformation, we first define a wave function for the CMC hierarchy. This leads to a pair of additiona…

2014-08-14abs ↗pdf ↗

We solve for functions from their truncated Hilbert transforms using Chebyshev series.

problem Finding functions from their truncated Hilbert transforms.
method Express functions in Chebyshev series and numerically estimate coefficients.
result Numerical methods work well for extrapolating functions from truncated Hilbert transforms.

Paper proposes a new optimization framework for learning eigenfunctions of operators.

problem Computing eigenvalue decomposition of high-dimensional operators.
method Operator SVD with Neural Networks via Nested Low-Rank Approximation.
result Proposed method efficiently learns top-L singular values and functions in the correct order.

Using Monte Carlo simulation to calculate the Value at Risk (VaR) as a possible risk measure requires adequate techniques. One of these techniques is the application of a compound distribution for the aggregates in a portfolio. In this paper, we consider the aggregated loss of Gamma distributed severities and estimate …

2017-02-14abs ↗pdf ↗

Study on systole of random hyperbolic 3-manifolds, proving limit exists and calculating it.

problem Understanding the systole of random hyperbolic 3-manifolds.
method Modeling random hyperbolic 3-manifolds using truncated tetrahedra, calculating expected systole limit as volume increases.
result Closed formula and numerical approximation for the limit of the expected systole as volume tends to infinity.

Learning with a {\it convex loss} function has been a dominating paradigm for many years. It remains an interesting question how non-convex loss functions help improve the generalization of learning with broad applicability. In this paper, we study a family of objective functions formed by truncating traditional loss f…

2018-05-21abs ↗pdf ↗

Non-negative matrix factorization (NMF) minimizes the Euclidean distance between the data matrix and its low rank approximation, and it fails when applied to corrupted data because the loss function is sensitive to outliers. In this paper, we propose a Truncated CauchyNMF loss that handle outliers by truncating large e…

2019-06-02abs ↗pdf ↗

A growing body of literature suggests that heavy tailed distributions represent an adequate model for the observations of log returns of stocks. Motivated by these findings, here we develop a discrete time framework for pricing of European options. Probability density functions of log returns for different periods are …

2018-07-04abs ↗pdf ↗

PSLR classifies functional data with scalar covariates using path signatures.

problem Classical functional logistic regression models have limitations in capturing nonlinear and cross-channel dependencies.
method PSLR uses truncated path signatures to create a basis-free representation of functional data.
result PSLR outperforms traditional functional classifiers in accuracy and robustness, especially under non-uniform sampling.

This paper presents a new algorithm, termed \emph{truncated amplitude flow} (TAF), to recover an unknown vector x\bm{x} from a system of quadratic equations of the form yi=ai,x2y_i=|\langle\bm{a}_i,\bm{x}\rangle|^2, where ai\bm{a}_i's are given random measurement vectors. This problem is known to be \emph{NP-hard} in genera…

2016-05-26abs ↗pdf ↗

Proposes a method to handle sparse multiway count data with false zeros using zero-truncated Poisson regression.

problem Handling sparse multiway count data corrupted by false zeros.
method Zero-truncated Poisson regression with tensor completion.
result Accurate estimation of multiway count data from approximately IR2log22(I)IR^2\log_2^2(I) non-zero counts.

Paper tackles heavy-tailed data without finite variance, proposing robust risk minimization.

problem Empirical risk minimization under heavy-tailed data with finite pp-th moment.
method Minimizes risk values robustly estimated via Catoni's method, using generalized generic chaining.
result Shows better performance of optimizer based on empirical risks via Catoni-style estimation.

Paper develops approximation and statistical theory for signature-based path regression.

problem Understanding how fast signatures approximate continuous path functionals.
method Develops \(L^2\) approximation rate for smooth functionals of Itô diffusions and establishes consistency of statistical learning procedures.
result Signature-based methods improve prediction over handcrafted features in various real-data applications.

The present paper regards the volume function of a doubly truncated hyperbolic tetrahedron. Starting from the previous results of J. Murakami, U. Yano and A. Ushijima, we have developed a unified approach to express the volume in different geometric cases via dilogarithm functions and to treat properly the many analyti…

2012-03-05abs ↗pdf ↗

We propose a new framework for Hamiltonian Monte Carlo (HMC) on truncated probability distributions with smooth underlying density functions. Traditional HMC requires computing the gradient of potential function associated with the target distribution, and therefore does not perform its full power on truncated distribu…

2017-09-08abs ↗pdf ↗

Truncated Singular Value Decomposition (SVD) calculates the closest rank-kk approximation of a given input matrix. Selecting the appropriate rank kk defines a critical model order choice in most applications of SVD. To obtain a principled cut-off criterion for the spectrum, we convert the underlying optimization prob…

2011-02-15abs ↗pdf ↗

Physics-inspired methods optimize SVD compression of LLMs.

problem Efficiently compressing large language models (LLMs) using SVD.
method FermiGrad for globally optimal rank selection and PivGa for lossless compression.
result Global optimization of SVD ranks and lossless compression of low-rank factors.

Paper estimates spectral risk measures for insurance data with truncated and censored data.

problem Estimating spectral risk measures for insurance data with left truncation and right censoring.
method Proposes a non-parametric estimator using product limit estimator and establishes asymptotic normality.
result Proposed estimator outperforms existing methods for small k and small sample sizes.

The paper connects quantum 6j6j-symbols to tetrahedra volumes via discrete Fourier transforms.

problem Understanding the asymptotic behavior of quantum 6j6j-symbols and their relation to 3-manifold invariants.
method Proposing and proving a conjecture linking discrete Fourier transforms of quantum 6j6j-symbols to the volumes of deeply truncated tetrahedra.
result Supporting evidence for the conjecture in specific cases, with numerical calculations for larger dihedral angles.

As in standard linear regression, in truncated linear regression, we are given access to observations (Ai,yi)i(A_i, y_i)_i whose dependent variable equals yi=AiTx+ηiy_i= A_i^{\rm T} \cdot x^* + η_i, where xx^* is some fixed unknown vector of interest and ηiη_i is independent noise; except we are only given an observation if its dep…

2020-07-29abs ↗pdf ↗

A method for interpreting SVMs using polynomial kernels, revealing model complexity.

problem Interpreting SVMs built with truncated orthogonal polynomial kernels.
method Orthogonal Representation Contribution Analysis (ORCA) with normalized Orthogonal Kernel Contribution (OKC) indices.
result The method reveals structural aspects of model complexity not captured by predictive accuracy.