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

10213141 · Jun 202019922001200920172026
48 results for center exhaustivity

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.

Constructs constant spacetime mean curvature surfaces for hyperboloidal initial data sets.

problem Creating a foliation of constant spacetime mean curvature surfaces for asymptotically hyperboloidal initial data sets.
method Long time limit of volume preserving spacetime mean curvature flow starting from a constant mean curvature foliation.
result Obtains a foliation of constant spacetime mean curvature surfaces as the long time limit.

Unmanned Aerial Vehicles (UAVs), autonomously-guided aircraft, are widely used for tasks involving surveillance and reconnaissance. A version of the pursuit-evasion problems centered around UAVs and its variants has been extensively studied in recent years due to numerous breakthroughs in AI. We present an approach to …

2019-11-02abs ↗pdf ↗

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 ↗

Solves action selection for large spaces in RL, achieving near-optimal performance.

problem Selecting a small, representative subset of actions from a large, shared action space.
method Extends meta-bandit approach to MDPs, using a relaxed sub-Gaussian process model.
result Achieves performance comparable to full action space, with theoretical guarantees.

State-of-the-art named entity recognition (NER) systems have been improving continuously using neural architectures over the past several years. However, many tasks including NER require large sets of annotated data to achieve such performance. In particular, we focus on NER from clinical notes, which is one of the mos…

2018-12-13abs ↗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 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 ↗

The shape of homogeneous, generic, smooth convex bodies as described by the Euclidean distance with nondegenerate critical points, measured from the center of mass represents a rather restricted class M_C of Morse-Smale functions on S^2. Here we show that even M_C exhibits the complexity known for general Morse-Smale f…

2012-04-24abs ↗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 ↗

Center identified in stated skein algebra for quantum traces.

problem Understanding the center of the stated skein algebra.
method Analyzing the algebra as a generalization of Kauffman bracket skein algebra, focusing on the case when the quantum parameter is a root of unity.
result Simple description and dimension calculation of the center over the center module.

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 ↗

The object of our investigation is a point that gives the maximum value of a potential with a strictly decreasing radially symmetric kernel. It defines a center of a body in Rm. When we choose the Riesz kernel or the Poisson kernel as the kernel, such centers are called a radial center or an illuminating center, respec…

2016-03-09abs ↗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 ↗

Refines geometric center of mass analysis for Einstein field equations.

problem Analyzing the geometric center of mass of Willmore surfaces in initial data for Einstein field equations.
method Refined Lyapunov-Schmidt analysis to study geometric center of mass of area-constrained Willmore surfaces.
result The geometric center of mass agrees with the Hamiltonian center of mass under specific conditions.

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 ↗

Let f:M->M be a partially hyperbolic diffeomorphism such that all of its center leaves are compact. We prove that Sullivan's example of a circle foliation that has arbitrary long leaves cannot be the center foliation of f. This is proved by thorough study of the accessible boundaries of the center-stable and the center…

2011-04-28abs ↗pdf ↗

We investigate centers of a body (the closure of a bounded open set) defined as maximum points of potentials. In particular, we study centers defined by the Riesz potential and by Poisson's integral. These centers, in general, depend on parameters and move with respect to the parameters. We give a necessary and suffici…

2016-03-28abs ↗pdf ↗

We prove the existence of a center, or continuous selection of a point, in the relative interior of C1C^1 embedded kk-disks in Riemannian nn-manifolds. If k3k\le 3 the center can be made equivariant with respect to the isometries of the manifold, and under mild assumptions the same holds for k=4=nk=4=n. By contrast, for…

2017-06-25abs ↗pdf ↗

This work analyzes centered binary Restricted Boltzmann Machines (RBMs) and binary Deep Boltzmann Machines (DBMs), where centering is done by subtracting offset values from visible and hidden variables. We show analytically that (i) centering results in a different but equivalent parameterization for artificial neural …

2013-11-06abs ↗pdf ↗

The paper quantizes concatenated noisy vectors to a common cluster center, improving performance over naive methods.

problem Clustering concatenated noisy vectors from multiple sources.
method Asymptotic analysis of weighted sum of distances to a common cluster center.
result The clustering approach outperforms naive methods in terms of average distortion.

In this study, we investigate the locus of the centers of the Meusnier spheres. Just as focal curve is the locus of the centers of the osculating spheres, we investigate the geometrical interpretation on the locus of the centers of the Meusnier spheres. We proved that if the curve is a principal line, the locus of the …

2013-07-16abs ↗pdf ↗

This article briefly introduced Arthur and Vassilvitshii's work on \textbf{k-means++} algorithm and further generalized the center initialization process. It is found that choosing the most distant sample point from the nearest center as new center can mostly have the same effect as the center initialization process in…

2019-03-24abs ↗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.

The determination of cluster centers generally depends on the scale that we use to analyze the data to be clustered. Inappropriate scale usually leads to unreasonable cluster centers and thus unreasonable results. In this study, we first consider the similarity of elements in the data as the connectivity of nodes in an…

2016-10-19abs ↗pdf ↗