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

Trend · papers per month

1122 · Jan 202119922001200920172026
9 results for 2-uniform

The paper extends Strichartz's conjecture to spinor bundles over real hyperbolic spaces.

problem Extending Strichartz's conjecture to spinor bundles.
method Characterization of Poisson transform for spinor bundles and uniform L2L^2 estimates.
result Strichartz's conjecture is extended to spinor bundles over real hyperbolic spaces.

The paper provides estimates for higher-order Ricci curvature along Kähler-Ricci flows.

problem Estimating higher-order curvature along Kähler-Ricci flows on compact Kähler manifolds.
method Proving uniform bounds for Ricci curvature and scalar curvature in various orders and norms.
result A geometric obstruction causes a specific third-order derivative of Ricci curvature to blow up at rate et/2e^{t/2}.

This work optimizes alignment and uniformity of features on a hypersphere for better downstream performance.

problem Improving the performance of contrastive representation learning.
method Identifying and optimizing alignment and uniformity of features on a hypersphere.
result Directly optimizing alignment and uniformity leads to comparable or better performance than contrastive learning.

Study shows gap between uniform convergence and test error in random feature models.

problem Understanding the gap between uniform convergence and test error in random feature models.
method Analytical expressions for uniform convergence over norm balls, interpolators, and minimum norm interpolator risk derived and proved.
result Uniform convergence over interpolators still gives a non-trivial bound of test error even when classical uniform convergence is vacuous.

A novel hypergraph partitioning method using tensor eigenvalue decomposition captures super-dyadic interactions.

problem Capturing super-dyadic interactions in k-uniform hypergraphs.
method Tensor-based representation and tensor eigenvalue decomposition for capturing interactions.
result Improved min-cut solution on 2-uniform hypergraphs (graphs) compared to standard spectral partitioning.