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

55111166221 · May 202619922001200920172026
48 results for weak directions

We present a graphical criterion for reading dependencies from the minimal directed independence map G of a graphoid p when G is a polytree and p satisfies composition and weak transitivity. We prove that the criterion is sound and complete. We argue that assuming composition and weak transitivity is not too restrictiv…

2012-06-20abs ↗pdf ↗

New methods validate a hypothesis explaining how neural nets generalize well.

problem Why over-parameterized nets generalize well despite memorizing training data.
method Developed new algorithms to suppress weak gradient directions without per-example gradients.
result Validated a hypothesis about gradient directions and their role in generalization.

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 ↗

Fix a translation surface XX, and consider the measures on XX coming from averaging the uniform measures on all the saddle connections of length at most RR. Then as RR\to\infty, the weak limit of these measures exists and is equal to the Lebesgue measure on XX. We also show that any weak limit of a subsequence of …

2017-05-30abs ↗pdf ↗

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.

New method estimates model performance bounds without ground truth labels.

problem Evaluation of weakly supervised models without direct access to ground truth labels.
method Formulates model evaluation as a partial identification problem and uses Fréchet bounds for performance estimation.
result Derives accurate and computationally efficient bounds for key metrics like accuracy, precision, recall, and F1-score.

Study shows how a strong model can learn a task's feature while retaining other capabilities.

problem How to align superhuman AI systems using weak-to-strong generalization.
method Two-layer neural networks, reward-model learning, multi-step SGD, feature learning.
result The strong model efficiently learns task features while retaining general capabilities.

Characterizes when differential forms have weak exterior derivatives based on limiting behavior of integration over simplices.

problem Characterizing differential forms with weak exterior derivatives.
method Uses integration over simplices to characterize the limiting behavior of differential forms.
result Proves a direct analogue of the Bourgain-Brezis-Mironescu characterization for differential forms.

For Finsler metrics (no reversibility assumed) on closed orientable surfaces of genus greater than one, we study the dynamics of minimal rays and minimal geodesics in the universal cover. We prove in particular, that for almost all asymptotic directions the minimal rays with these directions laminate the universal cove…

2014-04-02abs ↗pdf ↗

Suppose a sequence MjM_j of Alexandrov spaces collapses to a space XX with only weak singularities. Yamaguchi constructed a map fj:MjXf_j:M_j\to X called an almost Lipschitz submersion for large jj. We prove that if MjM_j has a uniform positive lower bound for the volumes of spaces of directions, which is sufficiently la…

2019-05-14abs ↗pdf ↗

Paper presents a new policy gradient theorem using weak derivatives for reinforcement learning.

problem Continuous state-action reinforcement learning problems.
method Introduced an alternative policy gradient theorem using weak derivatives.
result The new approach yields algorithms that converge almost surely to stationary points of the value function.

Investigates how diversification preferences relate to risk attitudes.

problem Connecting diversification preferences to risk attitudes.
method Analyzes diversification preferences for various pairs of risks under different conditions.
result Diversification preferences for certain pairs of risks imply specific levels of risk aversion.

The curve graphs are not locally finite. In this paper, we show that the curve graphs satisfy a property which is equivalent to graphs being uniformly locally finite via Masur--Minsky's subsurface projections. As a direct application of this study, we show that there exist computable bounds for Bowditch's slices on tig…

2013-12-18abs ↗pdf ↗

AutoWS-Bench-101 evaluates automated weak supervision methods for diverse domains.

problem Limited applicability of weak supervision due to difficulty in designing labeling functions.
method Automates labeling function design using a small set of ground truth labels.
result AutoWS methods often require foundation models to outperform simple few-shot baselines.

The existence of a flat torsion-free connection, or left symmetric algebra structure on a Lie algebra g gives rise to a canonically defined complex structure on g+g and a symplectic structure on g+g^*. We verify that the associated differential Gerstenhaber algebras controlling the deformation theories of the complex a…

2008-04-30abs ↗pdf ↗

Novel weak solutions for volume-preserving mean curvature flow established.

problem Existence and uniqueness of solutions to volume-preserving mean curvature flow.
method Introducing varifold solutions coupled with phase volumes and new calibrations.
result Uniqueness of classical solutions among varifold solutions.

A complex symplectic structure on a Lie algebra $\lie h$ is an integrable complex structure JJ with a closed non-degenerate (2,0)(2,0)-form. It is determined by JJ and the real part ΩΩ of the (2,0)(2,0)-form. Suppose that $\lie h$ is a semi-direct product $\lie g\ltimes V$, and both $\lie g$ and VV are Lagrangian with re…

2010-04-19abs ↗pdf ↗

We introduce the concept of partial Poisson structure on a manifold MM modelled on a convenient space. This is done by specifying a (weak) subbundle TMT^{\prime}M of TMT^{\ast}M and an antisymmetric morphism P:TMTMP:T^{\prime}M\rightarrow TM such that the bracket {f,g}P=<df,P(dg)>\{f,g\}_{P}=-<df,P(dg)> defines a Poisson bracket on the …

2018-08-08abs ↗pdf ↗

New proof shows how to identify DAGs with weakly increasing errors.

problem Identifying the true DAG in models with weakly increasing error variances.
method Minimum-trace DAG method and hill climbing algorithm with R2R neighborhood.
result Hill climbing algorithm without strict local optima under weakly increasing error variances.

The paper breaks down AUC into cluster-level components for better model diagnostics.

problem Global AUC masks weaknesses in specific subpopulations, leading to financial or operational risks.
method Formal decomposition of AUC into intra- and inter-cluster components, comparing with other performance metrics.
result Allows practitioners to evaluate and diagnose model performance within and across clusters.

We present several new results on the feasibility of inferring the hidden states in strongly-connected trackable weak models. Here, a weak model is a directed graph in which each node is assigned a set of colors which may be emitted when that node is visited. A hypothesis is a node sequence which is consistent with a g…

2020-01-08abs ↗pdf ↗

In this paper we show how, under surprisingly weak assumptions, one can split a planar curve into three arcs and rearrange them (matching tangent directions) to obtain a closed curve. We also generalize this construction to curves split into kk arcs and comment what can be achieved by rearranging arcs for a curve in h…

2020-02-13abs ↗pdf ↗

Gradient descent converges to minimum Bayes risk for two-layer ReLU networks in mean field regime.

problem Training two-layer ReLU networks using gradient descent in the mean field regime.
method Describes a condition for convergence to minimum Bayes risk, extending previous results to ReLU-activated networks.
result The condition for convergence does not depend on initialization and concerns weak convergence of network realization.

I analyze the one-dimensional, cubic Schrödinger equation, with nonlinearity constructed from the current density, rather than, as is usual, from the charge density. A soliton solution is found, where the soliton moves only in one direction. Relation to higher-dimensional Chern--Simons theory is indicated. The theory i…

1996-11-22abs ↗pdf ↗

Paper relaxes symmetry conditions for universal feature selection in noisy data.

problem Feature selection in noisy data with weak symmetry.
method Developed a universal feature selection framework using singular value decomposition of canonical dependence matrix.
result Selected features achieve asymptotically optimal error exponents up to a residual term.

We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe (2011) from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this connection allows us to obtain strong multiplicative performance bounds on several meth…

2016-12-02abs ↗pdf ↗

A persistent challenge in practical classification tasks is that labeled training sets are not always available. In particle physics, this challenge is surmounted by the use of simulations. These simulations accurately reproduce most features of data, but cannot be trusted to capture all of the complex correlations exp…

2018-01-30abs ↗pdf ↗

Interactive machine learning with weak supervision and pre-trained embeddings.

problem Training machine learning models with limited labeled data.
method Use pre-trained embeddings to define a distance function and extend source votes to nearby points.
result Significantly outperforms traditional weakly-supervised and fully-supervised methods.

Improved NER performance on imbalanced data.

problem Highly unbalanced training data in NER tasks.
method Adapted a neural architecture with CRF and BI-LSTM layers, using pre-trained embeddings. Introduced a two-class split to optimize performance.
result Significant improvement in performance for weak classes with minimal training data.

In this paper we consider the problem of graph-based transductive classification, and we are particularly interested in the directed graph scenario which is a natural form for many real world applications. Different from existing research efforts that either only deal with undirected graphs or circumvent directionality…

2014-02-19abs ↗pdf ↗

BRACE addresses noncompliance in bandits, offering methods for recommendation and treatment policies.

problem Noncompliance in bandit problems complicates learning objectives and treatment effects.
method BRACE formalizes objective-choice, identifies direct-control regimes, and proposes a phase-doubling algorithm for IV inversion.
result BRACE delivers valid policy values and structural uncertainty, even under weak identification and homogeneity failure.