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

Trend · papers per month

14284155 · Jun 202019922001200920172026
48 results for weak necessity

The paper addresses bias amplification in prediction and decision-making using causal analysis.

problem Bias amplification in automated systems, especially after thresholding.
method Introduces margin complement and causal decomposition of prediction disparities.
result Disparity in predictor Y^\widehat Y can be decomposed into causal influences of XX on SS and MM.

Paper proposes forecast-necessity testing for accurate causal interpretation in nonlinear time-series models.

problem Misinterpretation of causal scores from nonlinear models as regression coefficients.
method Systematic edge ablation and forecast comparison to evaluate causal necessity.
result Causal relationships with similar scores can differ in their necessity for accurate prediction.

Unified feature importance for machine learning models tackles sufficiency and necessity limitations.

problem Insufficient and incomplete explanations of machine learning models.
method Formalized sufficiency and necessity notions, proposing a unified importance measure.
result Unified importance measure detects features missed by sufficiency and necessity alone.

Paper presents a dynamic tail risk protection strategy using ML and econometrics.

problem Tail risk protection in finance with solid mathematical and statistical tools.
method Dynamic tail risk protection strategy using weak classifiers (parametric and non-parametric) to estimate exceedance probability and derive trading signals.
result Ensemble classifier improves generalization and trading performance.

Study finds cryptocurrency market diversity patterns inconsistent with neutral models.

problem Cryptocurrency market diversity patterns not consistent with neutral models.
method Analysis borrowing methods from ecology, focusing on diversity patterns and community structure.
result Cryptocurrency market diversity patterns not consistent with neutral models, suggesting strong interactions between species.

New DA method CIRM outperforms existing methods under structural causal model assumptions.

problem Improving prediction performance in domain adaptation with perturbed source and target data.
method Theoretical framework based on structural causal models to analyze and compare DA methods.
result CIRM method outperforms existing methods when covariates and label distributions are perturbed in target data.

Transformers show strengths and weaknesses in complexity analysis.

problem Understanding the strengths and limitations of attention layers in transformers.
method Analysis of representation power through complexity parameters and task-specific constructions.
result Transformers can solve sparse averaging tasks with logarithmic complexity, but triple detection tasks require linear complexity.

AdaDKRR tackles data silos by combining autonomy, privacy, and collaboration.

problem Data silos caused by privacy and interoperability constraints.
method Adaptive distributed kernel ridge regression (AdaDKRR) with autonomy, privacy, and collaboration.
result AdaDKRR performs similarly to optimal learning algorithms on the whole data under mild conditions.

Improved variational inequality algorithms using adaptive step sizes.

problem Solving monotone variational inequalities and convex-concave min-max problems efficiently.
method Adaptive step sizes that eliminate hyperparameters and global Lipschitz continuity requirements.
result Eliminated the need for the golden ratio in the algorithm and improved complexity bounds.

The great success of deep learning poses urgent challenges for understanding its working mechanism and rationality. The depth, structure, and massive size of the data are recognized to be three key ingredients for deep learning. Most of the recent theoretical studies for deep learning focus on the necessity and advanta…

2019-12-16abs ↗pdf ↗

Optimal machine learning requires interpolating training data in high-dimensional linear regression.

problem Achieving optimal predictive risk in overparameterized linear regression models.
method Analyzing proportional asymptotics of random design and label noise variance.
result Optimal performance in linear regression requires fitting training data to higher accuracy than inherent noise.

We discuss general notions of metrics and of Finsler structures which we call weak metrics and weak Finsler structures. Any convex domain carries a canonical weak Finsler structure, which we call its tautological weak Finsler structure. We compute distances in the tautological weak Finsler structure of a domain and we …

2008-04-04abs ↗pdf ↗

DOODLER detects out-of-distribution inputs by reconstructing in-distribution data.

problem Detecting real-world out-of-distribution inputs for deep learning models.
method DOODLER uses a Variational Auto-Encoder to reconstruct in-distribution data and identifies failures as out-of-distribution.
result DOODLER outperforms other OOD detection methods under similar constraints.

The study examines conditions for weak nearly cosymplectic manifolds to split into products.

problem Understanding the curvature and topology of weak nearly cosymplectic manifolds.
method Analyzes the conditions for splitting and characterizes specific manifolds.
result Conditions for weak nearly cosymplectic manifolds to become Riemannian products are identified.

Defines weak geodesics on specific subsets of manifolds.

problem Characterizing geodesics on prox-regular subsets of Riemannian manifolds.
method Defining weak geodesics as continuous curves with weak regularities, and characterizing them as viscosity critical points of the energy functional.
result Characterizes weak geodesics on prox-regular subsets of Riemannian manifolds.

New model shows weak teachers can help strong students learn even with imperfect labels.

problem Improving strong student's performance with weak teacher's imperfect pseudolabels.
method Stylized overparameterized spiked covariance model with Gaussian covariates, proving two phases of generalization.
result Provable successful and random guessing phases of strong student's generalization.

Introduces weak (p,k)(p,k)-Dirac structures in geometric settings.

problem Defining and analyzing new geometric structures.
method Introducing and studying weak (p,k)(p,k)-Dirac structures in TMΛpTMTM \oplus \Lambda^pT^*M.
result Weak (p,k)(p,k)-Dirac structures contain more information than (p,k)(p,k)-Lagrangian structures.

RAVEN improves weak-to-strong generalization under distribution shifts.

problem Weak models fail to supervise strong models effectively under distribution shifts.
method RAVEN dynamically learns optimal combinations of weak models and strong model parameters.
result RAVEN outperforms existing methods by over 30% on out-of-distribution tasks.

Study weak ff-K-contact manifolds, finding Einstein-type metrics and solitons.

problem Characterize and study geometric properties of weak ff-K-contact manifolds.
method Analyzing weak metric ff-structures, using Killing vector fields, and Jacobi operators.
result Einstein weak ff-K-contact manifolds are Ricci flat.

Study the geometry of weak para-f-structures and subclasses.

problem Understand the geometry of weak para-f-structures and their subclasses.
method Express covariant derivative of f, prove Killing characteristic vector fields, show foliations, and demonstrate rigidity.
result Prove that characteristic vector fields are Killing and ker f defines a totally geodesic foliation.

We prove that every Kaehler solvmanifold has a finite covering whose holomorphic reduction is a principal bundle. An example is given that illustrates the necessity, in general, of passing to a proper covering. We also answer a stronger version of a question posed by Akhiezer for homogeneous spaces of nonsolvable algeb…

2007-01-31abs ↗pdf ↗

The study explores new metric structures on manifolds, linking them to Einstein metrics.

problem Characterizing and understanding weak K-contact manifolds and their properties.
method Analyzing weak K-contact manifolds and their properties, including the parallel Ricci tensor and generalized Ricci soliton structures.
result Sufficient conditions for weak K-contact manifolds with specific properties to be Einstein manifolds.

Study on Ricci solitons and Einstein metrics in weak β-Kenmotsu manifolds.

problem Characterizing Einstein metrics in weak β-Kenmotsu manifolds.
method Adapted \ast-Ricci tensor to weak almost contact manifolds and studied its interaction with weak β-Kenmotsu structures.
result New characteristics of Einstein metrics obtained.

Equivalent bicategories constructed from action Lie groupoids.

problem Equivalence of bicategories constructed from action Lie groupoids.
method Localizing at equivariant weak equivalences, surjective submersive equivariant weak equivalences, and all weak equivalences.
result Weak equivalences between action Lie groupoids are isomorphic to compositions of nice forms of equivariant weak equivalences.

In this work we wish characterize the Einstein manifolds (M,g)(M,g), however without the necessity of hypothesis of compactness over MM and unitary volume of gg, which are well known in many works. Our result says that if all eingenvalues λλ of rgr_{g}, with respect to gg, satisfy λ1nsgλ\geq \frac{1}{n}s_{g}, then $(M,g)…

2009-12-17abs ↗pdf ↗

Formalizes weak and strong verification for LLMs, controlling errors without assumptions.

problem Balancing cost and reliability in reasoning with LLMs.
method Formalizes weak-strong verification policies, introduces metrics, develops online algorithm.
result Optimal policies admit a two-threshold structure, and calibration and sharpness govern value of weak verifiers.

In this paper we discuss the possibility of using multilevel Monte Carlo (MLMC) methods for weak approximation schemes. It turns out that by means of a simple coupling between consecutive time discretisation levels, one can achieve the same complexity gain as under the presence of a strong convergence. We exemplify thi…

2014-06-10abs ↗pdf ↗

Random feature models can outperform a weak teacher with early stopping.

problem Generalization from a weak to a strong model in random feature networks.
method Random feature models, early stopping, proving weak-to-strong generalization.
result Random feature models can outperform a weak teacher with early stopping.

Paper establishes a general inequality for warped product CR-submanifolds in Kähler manifolds.

problem Finding a general inequality for warped product contact CR-submanifolds in Kähler manifolds.
method Using the Gauss equation, the paper establishes a general inequality for warped product contact CR-submanifolds in Sasakian and Kenmotsu manifolds.
result The paper proves an optimal general inequality for warped product contact CR-submanifolds in both Sasakian and Kenmotsu manifolds.