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

Trend · papers per month

110219329438 · Jun 202019922001200920172026
48 results for one-sided random variables

Investigates VaR behavior for sums of one-sided random variables, showing impossibilities and conditions for super-additivity.

problem Investigates the behavior of Value-at-Risk (VaR) for sums of one-sided random variables.
method Analyzes the extremal aggregation behavior of VaR, introduces structural conditions for super-additivity.
result Characterizes when VaR is fully super-additive and provides unified framework for various dependence structures.

Efficient algorithm approximates discrete random variables with minimal Kolmogorov distance.

problem Estimating the probability of missing deadlines in series-parallel schedules.
method An efficient algorithm that computes a random variable with minimal Kolmogorov distance to a given discrete random variable.
result The algorithm efficiently approximates the probability of missing deadlines with minimal Kolmogorov distance.

With any non necessarily orientable unpunctured marked surface (S,M) we associate a commutative algebra, called quasi-cluster algebra, equipped with a distinguished set of generators, called quasi-cluster variables, in bijection with the set of arcs and one-sided simple closed curves in (S,M). Quasi-cluster variables a…

2011-05-08abs ↗pdf ↗

Online learning with one-sided feedback aims to maximize accuracy while ensuring fairness.

problem Maximizing accuracy in online learning with limited feedback and ensuring fairness.
method Extending the framework of Bechavod et al. (2020) to incorporate dynamic panels of auditors, reducing the problem to a contextual combinatorial semi-bandit, and leveraging Exp2 and Context-Semi-Bandit-FTPL algorithms.
result Multi-criteria no regret guarantees for accuracy and fairness are provided.

A new framework improves VaR recalibration by balancing reliance on imperfect volatility proxies.

problem How to balance reliance on imperfect volatility proxies in one-sided VaR recalibration.
method Proxy-reliance control framework that interpolates between constant-shift and proxy-scaled corrections.
result Lower or intermediate proxy reliance can outperform fully proxy-scaled recalibration in stressed left-tail VaR control.

We define a notion of Hempel distance for one-sided Heegaard splittings and show that the existence of alternate surfaces restricts distance for one-sided splittings in a manner similar to Hartshorn's and Scharlemann-Tomova's results for two-sided splittings. We also show that every geometrically compressible one-sided…

2011-12-02abs ↗pdf ↗

When a Dehn filled link manifold contains a geometrically incompressible one-sided surface, it is shown there is a unique boundary incompressible position that the surface can take in the link space. The proof uses a version of the sweep-out technique from two-sided Heegaard splitting theory. When applied to one-sided …

2008-07-30abs ↗pdf ↗

In this paper we prove an extrinsic one-sided curvature estimate for disks embedded in R3\mathbb{R}^3 with constant mean curvature which is independent of the value of the constant mean curvature. We apply this extrinsic one-sided curvature estimate in [24] to prove to prove a weak chord arc type result for these disks…

2014-08-22abs ↗pdf ↗

Using basic properties of one-sided Heegaard splittings, a direct proof that geometrically compressible one-sided splittings of RP^3 are stabilised is given. The argument is modelled on that used by Waldhausen to show that two-sided splittings of S^3 are standard.

2005-09-01abs ↗pdf ↗

Adam-type optimizers show one-sided convergence in GAN training, not reaching critical points.

problem Theoretical understanding of Adam-type optimizers in non-convex non-concave min-max optimization.
method Empirical and theoretical analysis of Adam-type algorithms' convergence in GAN training.
result Adam-type algorithms converge to one-sided first order stationary points under the one-sided MVI condition.

Various structural properties are developed for non-orientable surfaces in link spaces. The Möbius band tree is described to represent genus growth of one-sided surfaces in solid tori. The structure of the Tree allows various insights into the change of genus under boundary slope, which are not possible using the exist…

2011-01-13abs ↗pdf ↗

A new method for selective classification trades off accuracy for coverage.

problem Selective classification allows a classifier to abstain from predicting some instances.
method Optimizes a collection of class-wise decoupled one-sided empirical risks.
result The method achieves near-optimal coverage in high target accuracy regimes.

Study one-sided matrix completion with two observations per row.

problem Recover right singular vectors of a low-rank matrix XX with few observations.
method Impute missing values of XTXX^TX and analyze recovery guarantees.
result Provable recovery of XTXX^TX with Ω(r2dlogd)Ω(r^2 d \log d) rows, outperforming standard methods.

New methods improve online matrix optimization with reduced computational cost.

problem Online matrix optimization with operator norm constraints.
method Gradient-based prediction scheme with smoothed potentials for nuclear norm.
result Adaptive matrix optimizers match Shampoo's regret up to a constant factor.

ARL and Hawkes processes improve market-making strategies with variable volatility.

problem Enhancing market-making strategies to adapt to varying volatility levels and self-exciting behaviors.
method Integrates ARL, Hawkes processes, and variable volatility levels; shifts from Poisson to Hawkes process.
result 4-action MM trained in low-volatility environment adapts to high-volatility conditions, providing stable performance.

Let ΣΣ be a codimension one submanifold of an nn-dimensional Riemannian manifold MM, n2n\geqslant 2. We give a necessary condition for an isometric immersion of ΣΣ into Rq\mathbb R^q equipped with the standard Euclidean metric, qn+1q\geqslant n+1, to be locally isometrically C1C^1-extendable to MM. Even if this cond…

2014-10-01abs ↗pdf ↗

Clustering is a central approach for unsupervised learning. After clustering is applied, the most fundamental analysis is to quantitatively compare clusterings. Such comparisons are crucial for the evaluation of clustering methods as well as other tasks such as consensus clustering. It is often argued that, in order to…

2017-01-23abs ↗pdf ↗

We solve matrix denoising with both row and column correlations, setting limits and designing optimal methods.

problem Matrix denoising with doubly heteroscedastic noise (both row and column correlations).
method Established information-theoretic and algorithmic limits, designed a novel spectral estimator with optimality guarantees.
result The novel spectral estimator achieves positive correlation with the signal and Bayes-optimal error under one-sided heteroscedasticity.

We prove some half-space theorems for minimal surfaces in the Heisenberg group Nil_3 and the Lie group Sol_3 endowed with their left-invariant Riemannian metrics. If S is a properly immersed minimal surface in Nil_3 that lies on one side of some entire minimal graph G, then S is the image of G by a vertical translation…

2010-05-21abs ↗pdf ↗

New Q-learning algorithms reduce regret in inventory control problems.

problem Efficiently learning optimal policies in inventory control problems with limited feedback.
method Proposed Elimination-Based Half-Q-Learning (HQL) and Full-Q-Learning (FQL) algorithms with theoretical regret bounds.
result HQL incurs ildeO(H3T) ilde{\mathcal{O}}(H^3\sqrt{ T}) regret, FQL incurs ildeO(H2T) ilde{\mathcal{O}}(H^2\sqrt{ T}) regret, independent of state and action space sizes.

Sharp concentration results for sums of heavy-tailed random variables.

problem Analyzing sums of independent heavy-tailed random variables.
method Using concentration inequalities and large deviation principles for distributions satisfying specific tail bounds.
result Sharp concentration inequalities and large deviation results for sums of heavy-tailed random variables.

A new SOHP filter improves trend estimation in economic time series.

problem Improving trend estimation in nonlinear economic time series.
method Recursive application of one-sided HP filter on updated cyclical components, combined with an incremental HP filtering algorithm.
result Better performance of SOHP filter compared to other HP-type filters on real economic data.

Paper extends stochastic dominance for compound binomial distributions.

problem Stochastic dominance for infinite-mean random variables.
method Investigates properties and inclusion relationships of distribution classes, extends results to compound binomial distributions.
result Establishes necessary and sufficient conditions for first-order stochastic dominance preservation.

For a Catalan state CC of a lattice crossing L(m,n)L\left( m,n\right) with no returns on one side, we find its coefficient C(A)C\left( A\right) in the Relative Kauffman Bracket Skein Module expansion of L(m,n)L\left( m,n\right) . We show, in particular, that C(A)C\left( A\right) can be found using the plucking polynomial of a …

2017-11-14abs ↗pdf ↗

The comparison theory for the Riccati equation satisfied by the shape operator of parallel hypersurfaces is generalized to semi-Riemannian manifolds of arbitrary index, using one-sided bounds on the Riemann tensor which in the Riemannian case correspond to one-sided bounds on the sectional curvatures. Starting from 2-d…

1997-07-25abs ↗pdf ↗

New class of heavy-tailed distributions shows weighted averages dominate individual variables.

problem Understanding and comparing risks in heavy-tailed distributions.
method Introducing a new class of heavy-tailed distributions and proving stochastic dominance relations.
result Weighted averages of random variables in this class are stochastically larger than individual variables.

This work improves polynomial approximations for functions with asymmetric behavior.

problem Efficiently approximating functions with asymmetric behavior, especially those growing unbounded on one side.
method Introduces weighted deep polynomial approximants that combine learnable deep polynomials with one-sided weights.
result Weighted deep polynomial approximants outperform existing methods in approximating functions with asymmetric behavior.

Consider an experiment involving a potentially small number of subjects. Some random variables are observed on each subject: a high-dimensional one called the "observed" random variable, and a one-dimensional one called the "outcome" random variable. We are interested in the dependencies between the observed random var…

2018-06-13abs ↗pdf ↗

In this paper we develop a Morse theory for the uniform energy. We use the one-sided directional derivative of the distance function to study the minimizing properties of variations through closed geodesics. This derivative is then used to define a one-sided directional derivative for the uniform energy which allows us…

2016-09-29abs ↗pdf ↗