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

12233546 · Jun 202019922001200920172026
48 results for weak

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 ↗

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.

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.

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.

In this paper, I introduce weak representations of a Lie groupoid GG. I also show that there is an equivalence of categories between the categories of 2-term representations up to homotopy and weak representations of GG. Furthermore, I show that any VB-groupoid is isomorphic to an action groupoid associated to a weak…

2017-04-17abs ↗pdf ↗

A new method for weakly supervised learning that improves model accuracy.

problem Training machine learning models with precise labels is expensive; weak supervision provides a low-cost alternative.
method Data consistent weak supervision algorithm that searches over classifiers to find plausible labelings, considering features of the training data and estimating labels for low/no coverage data.
result Empirically, the method significantly outperforms state-of-the-art weak supervision methods on text and image classification tasks.

Paper introduces methods for more reliable probabilistic predictions with confidence intervals.

problem Inaccurate labeling of datasets due to unreliable probabilistic predictions from weak labeling functions.
method Proposes a methodology to provide confidence intervals for label probabilities using uncertainty sets of distributions.
result Improves reliability of probabilistic predictions and provides confidence intervals for label probabilities.

We detail the construction of a weak Poisson bracket over a submanifold of a smooth manifold M with respect to a local foliation of this submanifold. Such a bracket satisfies a weak type Jacobi identity but may be viewed as a usual Poisson bracket on the space of leaves of the foliation. We then lift this weak Poisson …

2015-11-18abs ↗pdf ↗

Functorial maps and weak parities are equivalent descriptions of rules of substitution virtual crossings for classical in diagrams of a knot in a way compatible with Reidemeister moves. We introduce the notion of maximal weak parity and describe it for knots in a given closed oriented surface. This weak parity defines …

2012-11-02abs ↗pdf ↗

Study shows financial value of weak information converges in discrete vs continuous markets.

problem Analyzing financial value of weak information in discrete vs continuous markets.
method Defined minimal probability measure and financial value of weak information, then showed convergence.
result Financial value of weak information converges in discrete vs continuous markets.

Weak diffusion priors can still perform well in inverse problems.

problem Using mismatched or low-fidelity diffusion priors in inverse problems.
method Extensive experiments and theoretical analysis combining Bayesian-consistency theory and local-correlation analysis.
result Weak priors succeed when measurements are highly informative, and they fail in other regimes.

New research shows label refinement and weak training have limitations for aligning LLMs.

problem Limitations of refinement methods for aligning large language models.
method Analyzed probabilistic assumptions and alternative approaches to label refinement and weak training.
result Label refinement and weak training suffer from irreducible error, leaving a performance gap.

The paper finds the Finsler structure of Apollonian weak metric on unit disc.

problem Understanding the Finsler structure of Apollonian weak metric on the unit disc.
method Analyzing the deformation of hyperbolic Poincaré metric by a closed 1-form.
result The Apollonian weak-Finsler structure has bounded below SS-curvature and flag curvature KK satisfying <K<1-\infty < K < -1.

Weak dual pairs defined in Dirac-Jacobi geometry, proving equivalence and leaf correspondence theorems.

problem Defining and studying weak dual pairs in Dirac-Jacobi structures.
method Adopting omni-Lie algebroid approach, proving equivalence and leaf correspondence theorems.
result Existence of self-dual pairs and alternative proof of normal form theorem.

The paper defines a new equivalence relation for knot projections and finds an infinite number of distinct classes.

problem Classifying knot projections based on weak homotopy equivalence.
method Defining weak (1, 2, 3) homotopy and using it to find an invariant.
result There are an infinite number of weak (1, 2, 3) homotopy equivalence classes of knot projections.

Study \ast-ηη-Ricci solitons on weak Kenmotsu ff-manifolds.

problem Characterize \ast-ηη-Ricci solitons on weak Kenmotsu ff-manifolds.
method Adapted \ast-Ricci tensor to weak metric ff-manifolds, studied the interaction with weak βfβf-Kenmotsu structure.
result Obtained new characteristics of ηη-Einstein metrics.

The study explores the strengths and weaknesses of models that generalize from weak to strong supervision.

problem Understanding the limitations and capabilities of models that generalize from weak to strong supervision.
method Theoretical analysis and experimental validation in both classification and regression settings.
result Theoretical bounds reveal the importance of strong generalization and calibration of the weak model and a careful balance in the training process.

ASTRA uses unlabeled data and weak rules to train deep models effectively.

problem Learning with weak supervision rules is challenging due to their heuristic and noisy nature.
method ASTRA framework that considers contextualized representations and pseudo-labels for unlabeled data, and a rule attention network to aggregate labels.
result Significant improvements over state-of-the-art baselines on text classification benchmarks.

Proves existence and uniqueness of weak solutions for specific equations.

problem Existence and uniqueness of solutions for generalized Monge-Ampère and deformed Hermitian-Yang-Mills equations.
method Combines viscosity-theoretic and pluripotential-theoretic techniques.
result Existence and uniqueness of weak solutions in boundary cases.

Combines foundation models with weak supervision to improve NLP and video tasks.

problem Leveraging weak supervision with foundation models without labeled data.
method Liger, a combination of foundation model embeddings and weak supervision techniques.
result Liger outperforms existing weak supervision methods by 14.1 points on benchmark NLP and video tasks.

Study approximates weak error for specific stochastic models with rough and Gaussian mean-reverting volatility.

problem Approximating weak error for specific stochastic models with rough and Gaussian mean-reverting volatility.
method Used Euler type scheme with integrated kernels to study weak convergence rate.
result Obtained weak convergence rate of min(3α1,1)\min(3α-1,1) for discretised rough Ornstein-Uhlenbeck process and stochastic rough volatility model.

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.