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

481115 · Jun 202019922001200920172026
48 results for exhaustion

This paper exhausts curve complexes on non-orientable surfaces.

problem Proving exhaustion of curve complexes on non-orientable surfaces.
method Proving exhaustion via rigid expansions and graph endomorphisms.
result Any graph endomorphism of curve complexes whose restriction to a finite rigid set is injective is induced by a homeomorphism.

Let NN be a compact, connected, nonorientable surface of genus gg with nn boundary components. Let C(N)\mathcal{C}(N) be the curve complex of NN. We prove that if (g,n)=(3,0)(g,n) = (3,0) or g+n5g + n \geq 5, then there is an exhaustion of C(N)\mathcal{C}(N) by a sequence of finite rigid sets. This improves the author's result on…

2019-06-13abs ↗pdf ↗

Researchers solved a model of an exhaustible resource with stochastic discoveries.

problem Optimal exploration of an exhaustible resource with uncertain discoveries.
method Impulse control and Poisson process of new discoveries.
result A frontier of critical levels of proven reserves exists, above which exploration is stopped.

We propose a K-sparse exhaustive search (ES-K) method and a K-sparse approximate exhaustive search method (AES-K) for selecting variables in linear regression. With these methods, K-sparse combinations of variables are tested exhaustively assuming that the optimal combination of explanatory variables is K-sparse. By co…

2017-07-07abs ↗pdf ↗

We prove that if a smoothly bounded strongly pseudoconvex domain DCnD \subset \mathbb C^n, n2n \geq 2, admits at least one Monge-Ampère exhaustion smooth up to the boundary (i.e. a plurisubharmonic exhaustion τ:D[0,1]τ: \overline D \to [0,1], which is C\mathcal C^\infty at all points except possibly at the unique minimum poi…

2017-07-27abs ↗pdf ↗

The paper explores uniform perfectness and centers in Morse boundaries.

problem Detecting κκ-center exhaustivity in uniformly perfect Morse boundaries.
method Analyzes CAT(0) and geodesic spaces, using visual boundary data and metric transforms.
result Fixed-basepoint uniform perfectness is insufficient for κκ-center exhaustivity.

The paper studies Kähler metrics from finite Monge-Ampère mass exhaustion functions.

problem Investigating the spectrum of complete Kähler metrics from finite Monge-Ampère mass exhaustion functions.
method Analyzing logarithmic potentials and the associated complete Kähler metrics, proving bounds on the spectrum using the finite Monge-Ampère mass condition.
result The lower bound of the spectrum of the Laplace-Beltrami operator is n2n^2 under the finite Monge-Ampère mass condition.

We consider three fundamental classes of compact almost homogeneous manifolds and show that the complements of singular complex orbits in such manifolds are endowed with plurisubharmonic exhaustions satisfying complex homogeneous Monge-Ampère equations. This extends to a new family of mixed type examples various classi…

2017-06-04abs ↗pdf ↗

In this paper, aimed at exploring the fundamental properties of isoperimetric region in 33-manifold (M3,g)(M^3,g) which is asymptotic to Anti-de Sitter-Schwarzschild manifold with scalar curvature R6R\geq -6, we prove that connected isoperimetric region {Di}\{D_i\} with Hg3(Di)δ0>0\mathcal{H}_g ^3(D_i)\geq δ_0>0 cannot slide off to …

2015-12-09abs ↗pdf ↗

By a theorem of Greene and Wu, a noncompact connected Riemannian manifold admits a smooth strictly subharmonic exhaustion function. Demailly provided an elementary proof of this fact. A further simplification of Demailly's proof and some (mostly known) applications are described. Applications include the fact that the …

2004-05-27abs ↗pdf ↗

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.

For an orientable surface SS of finite topological type with genus g3g \geq 3, we construct a finite set of curves whose union of iterated rigid expansions is the curve graph of SS. The set constructed, and the method of rigid expansion, are closely related to Aramayona and Leiniger's finite rigid set, and in fact a …

2016-11-23abs ↗pdf ↗

Non-exhaustive learning (NEL) is an emerging machine-learning paradigm designed to confront the challenge of non-stationary environments characterized by anon-exhaustive training sets lacking full information about the available classes.Unlike traditional supervised learning that relies on fixed models, NEL utilizes se…

2019-08-26abs ↗pdf ↗

A compact real analytic Riemannian manifold M admits a canonical complexification with plurisubharmonic exhaustion function satisfying the homogeneous complex Monge-Ampere equation, called a Grauert tube. From the point of view of complex analysis, several authors have considered whether a given complex manifold can ar…

2000-10-30abs ↗pdf ↗

A finitely presented group is weakly geometrically simply connected (wgsc) if it is the fundamental group of some compact polyhedron whose universal covering is wgsc i.e. it has an exhaustion by compact connected and simply connected sub-polyhedra. We show that this condition is almost-equivalent to Brick's qsf propert…

2006-10-30abs ↗pdf ↗

In this paper we study the Sasakian geometry on S^3-bundles over a Riemann surface of genus g>0 with emphasis on extremal Sasaki metrics. We prove the existence of a countably infinite number of inequivalent contact structures on the total space of such bundles that admit 2-dimensional Sasaki cones each with a Sasaki m…

2013-02-04abs ↗pdf ↗

We generalize A. Borbély's condition for the conclusion of the Omori-Yau maximum principle for the Laplace operator on a complete Riemannian manifold to a second-order linear semi-elliptic operator LL with bounded coefficients and no zeroth order term. Also, we consider a new sufficient condition for the existence of …

2013-09-30abs ↗pdf ↗

This paper improves image super-resolution by integrating cross-scale non-local attention.

problem Improving image super-resolution by leveraging long-range and cross-scale feature correlations.
method Proposes a Cross-Scale Non-Local (CS-NL) attention module integrated into a recurrent neural network.
result Significantly improved performance on SISR benchmarks.

Typical existence result on Ricci-flat metrics is in manifolds of finite geometry, that is, on F=FˉDF=\bar F-D where Fˉ\bar F is a compact Kähler manifold and DD is a smooth divisor. We view this existence problem from a different perspective. For a given complex manifold XX, we take a suitable exhaustion $\{X_r\}_{r>0}…

2010-09-20abs ↗pdf ↗

Study shows torsion grows subexponentially in book of I-bundles but can grow exponentially in non-regular covers.

problem Growth rates of torsion in book of I-bundles.
method Analysis of torsion in homology of book of I-bundles using finite-sheeted covers.
result Torsion growth rates differ between regular and non-regular finite-sheeted covers.

Study improves predictive performance testing for high-dimensional data using exhaustive nested cross-validation.

problem Reproducibility issues in KK-fold cross-validation for high-dimensional data.
method Proposes a novel predictive performance test based on exhaustive nested cross-validation, addressing computational complexity with a closed-form expression.
result Demonstrates the effectiveness of Ridge-based methods in high-dimensional predictive performance testing.

For more than a decade Vytelingum's Adaptive-Aggressive (AA) algorithm has been recognized as the best-performing automated auction-market trading-agent strategy currently known in the AI/Agents literature; in this paper, we demonstrate that it is in fact routinely outperformed by another algorithm when exhaustively te…

2019-10-19abs ↗pdf ↗

Most structure inference methods either rely on exhaustive search or are purely data-driven. Exhaustive search robustly infers the structure of arbitrarily complex data, but it is slow. Data-driven methods allow efficient inference, but do not generalize when test data have more complex structures than training data. I…

2019-06-17abs ↗pdf ↗

We classify two-symmetric Lorentzian manifolds using methods of the theory of holonomy groups. These manifolds are exhausted by a special type of pp-waves and, like the symmetric Cahen-Wallach spaces, they have commutative holonomy.

2010-11-15abs ↗pdf ↗

We prove short time existence for the Ricci flow on open manifolds of nonnegative complex sectional curvature. We do not require upper curvature bounds. By considering the doubling of convex sets contained in a Cheeger-Gromoll convex exhaustion and solving the singular initial value problem for the Ricci flow on these …

2011-07-04abs ↗pdf ↗

Paper proposes a new co-clustering method for overlapping clusters and outliers.

problem Real-world datasets often contain overlaps and outliers in co-clusters.
method Formulated Non-Exhaustive, Overlapping Co-Clustering problem and developed NEO-CC algorithm.
result NEO-CC algorithm effectively captures underlying co-clustering structure of real-world data.

Third-order symmetric Lorentzian manifolds, i.e. Lorentzian manifold with zero third derivative of the curvature tensor, are classified. These manifolds are exhausted by a special type of pp-waves, they generalize Cahen-Wallach spaces and second-order symmetric Lorentzian spaces.

2014-07-14abs ↗pdf ↗

A two-step approach efficiently selects hyperparameters for FCMs.

problem Efficiently selecting hyperparameters for FCMs in a computationally expensive process.
method Two-step sequential approach: first estimate context length k, then estimate α.
result The proposed method achieves comparable compression performance to exhaustive search but with reduced computational cost.