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.

169,051 papers · 148 categories

Trend · papers per month

12.5%25.0%37.5%50.0% · Nov 199319922001200920182026
48 results for Baire sense

We prove that each coarsely homogenous separable metric space XX is coarsely equivalent to one of the spaces: the sigleton, the Cantor macro-cube or the Baire macro-space. This classification is derived from coarse characterizations of the Cantor macro-cube and of the Baire macro-space given in this paper. Namely, we …

2011-03-26abs ↗pdf ↗

The paper proves the existence of infinitely many minimal hypersurfaces in higher-dimensional manifolds.

problem Finding minimal hypersurfaces in higher-dimensional closed manifolds.
method Generic metrics and Baire sense arguments.
result Infinitely many singular minimal hypersurfaces are found in closed manifolds with optimal regularity.

For almost all Riemannian metrics (in the CC^\infty Baire sense) on a closed manifold Mn+1M^{n+1}, 3(n+1)73\leq (n+1)\leq 7, we prove that the union of all closed, smooth, embedded minimal hypersurfaces is dense. This implies there are infinitely many minimal hypersurfaces thus proving a conjecture of Yau (1982) for generic …

2017-10-30abs ↗pdf ↗

Minimal surfaces exist for most metrics on compact manifolds with boundary.

problem Existence of minimal surfaces in specific geometric settings.
method Proving existence for almost all Riemannian metrics on compact manifolds with boundary.
result Existence of compact, properly embedded free boundary minimal hypersurfaces for generic metrics.

The paper proves generic transversality and regularity for minimal submanifolds and area-minimizing currents.

problem Transversality and regularity of minimal submanifolds and area-minimizing currents.
method Proves transversality and regularity for generic metrics using Baire category and minimization properties.
result Generic metrics ensure transversality and regularity for minimal submanifolds and area-minimizing currents.

The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. We apply the Baire distance to spectrometric and photometric redshifts from the Sloan Digital Sky Survey using, in this work, about…

2011-04-20abs ↗pdf ↗

The Baire metric induces an ultrametric on a dataset and is of linear computational complexity, contrasted with the standard quadratic time agglomerative hierarchical clustering algorithm. In this work we evaluate empirically this new approach to hierarchical clustering. We compare hierarchical clustering based on the …

2011-06-11abs ↗pdf ↗

The paper explores generic properties of minimal surfaces in high dimensions.

problem Understanding the behavior of minimal surfaces in high-dimensional spaces.
method Analyzing the space of conformal minimal immersions using Baire category theory.
result A generic conformal minimal immersion is chaotic in various ways, such as being non-proper, almost proper, and gg-complete.

Can the Minkowski sum of two compact convex bodies be made smoother by rotating one of them? We construct two infinitely differentiable strictly convex plane bodies such that after any generic rotation (in the Baire category sense) of one of the summands the Minkowski sum is not five times differentiable. On the other …

2016-07-10abs ↗pdf ↗

For almost all Riemannian metrics (in the CC^\infty Baire sense) on a closed manifold Mn+1M^{n+1}, 3(n+1)73\leq (n+1)\leq 7, we prove that there is a sequence of closed, smooth, embedded, connected minimal hypersurfaces that is equidistributed in MM. This gives a quantitative version of the main result of \cite{irie-marques…

2017-12-18abs ↗pdf ↗

All projections of typical Cantor sets in high dimensions are Cantor sets.

problem Whether all projections of a typical Cantor set in high dimensions are Cantor sets.
method Proving that for a dense Gδ subset of Cantor sets, all projections into non-zero linear subspaces are Cantor sets.
result There exists a dense Gδ subset of Cantor sets such that all projections into non-zero linear subspaces are Cantor sets.

We describe many vantage points on the Baire metric and its use in clustering data, or its use in preprocessing and structuring data in order to support search and retrieval operations. In some cases, we proceed directly to clusters and do not directly determine the distances. We show how a hierarchical clustering can …

2011-11-27abs ↗pdf ↗

The premier exhibition of the following phenomenon: The fundamental group of any Peano continuum constructed in similar fashion to the Hawaiian earring admits two natural distinct topological group structures. However despite being uncountable and regular, neither group is a Baire space and hence neither group admits a…

2005-02-07abs ↗pdf ↗

The paper proves bounds on the Morse index of free boundary minimal hypersurfaces.

problem Finding bounds on the Morse index of free boundary minimal hypersurfaces.
method Min-max theory applied to (n+1)(n+1)-dimensional compact manifolds with boundary.
result Establishes general upper bounds for the Morse index of free boundary minimal hypersurfaces.

We introduce the natural and fairly general notion of a subanalytic bundle (with a finite dimensional vector space PP of sections) on a subanalytic subset XX of a real analytic manifold MM, and prove that when MM is compact, there is a Baire subset UU of sections in PP whose zero-loci in XX have tubular neighbou…

2003-07-02abs ↗pdf ↗

The study shows that certain metrics on spheres prevent stable tangent cones for area-minimizing boundaries.

problem Preventing stable tangent cones for area-minimizing boundaries under specific metrics.
method Developed a perturbation theorem and used spectral theory and compactness arguments.
result A residual set of metrics on Sn+1S^{n+1} precludes linearly stable tangent cones for area-minimizing boundaries.

The paper connects Diophantine approximation to black hole behavior, proving blow-up conditions.

problem Understanding the behavior of waves on Kerr-AdS black holes.
method Analyzing linear scalar perturbations and studying poles of the interior scattering operator.
result Perturbations ψψ blow up at the Cauchy horizon under certain non-Diophantine conditions.

Classifies geodesic planes outside convex core of geometrically finite 3-manifolds.

problem Classifying geodesic planes in geometrically finite 3-manifolds.
method Constructive proof involving exotic rays and roofs.
result Existence of exotic roofs depends on the existence of exotic rays and bending lamination properties.

A map f:XYf:X\to Y between topological spaces is defined to be {\em scatteredly continuous} if for each subspace AXA\subset X the restriction fAf|A has a point of continuity. We show that for a function f:XYf:X\to Y from a perfectly paracompact hereditarily Baire Preiss-Simon space XX into a regular space YY the scattere…

2008-01-14abs ↗pdf ↗

A new video prediction model treats videos as continuous processes, reducing sampling steps and improving efficiency.

problem Efficiency and temporal coherence in video prediction models.
method Treats videos as a continuous multi-dimensional process, reducing sampling steps.
result Reduction of 75% sampling steps, state-of-the-art performance on benchmark datasets.

In this partly expository monograph we develop a general framework for producing uncountable families of exotic actions of certain classically studied groups acting on the circle. We show that if LL is a nontrivial limit group then the nonlinear representation variety Hom(L,Homeo+(S1))\mathrm{Hom}(L,\mathrm{Homeo}_+(S^1)) contains u…

2016-10-13abs ↗pdf ↗

Mobile sensing is an emerging technology that utilizes agent-participatory data for decision making or state estimation, including multimedia applications. This article investigates the structure of mobile sensing schemes and introduces crowdsourcing methods for mobile sensing. Inspired by social network, one can estab…

2015-08-03abs ↗pdf ↗

New method for sensing non-planar surfaces using ERT.

problem Limited computational techniques for planar surfaces in ERT-based sensing skins.
method Generalized ERT to non-planar surfaces using Riemannian geometry.
result Feasibility and applicability of ERT-based sensing skins for non-planar geometries demonstrated.

Compressed sensing improves MRI scans with data-driven learning.

problem Challenges in applying compressed sensing from research to clinical practice.
method Data-driven learning to address challenges of hand-crafted priors, tuning parameters, and long reconstruction times.
result Compressed sensing can have greater clinical impact with data-driven learning.

This paper proposes a simple adaptive sensing and group testing algorithm for sparse signal recovery. The algorithm, termed Compressive Adaptive Sense and Search (CASS), is shown to be near-optimal in that it succeeds at the lowest possible signal-to-noise-ratio (SNR) levels, improving on previous work in adaptive comp…

2013-06-26abs ↗pdf ↗

Paper tackles online task allocation in multi-attribute social sensing.

problem Optimized task allocation in dynamic, multi-attribute social sensing.
method Quality-Cost-Aware Online Task Allocation (QCO-TA) scheme using online reinforcement learning.
result Significantly outperforms state-of-the-art baselines in sensing accuracy and cost.

DisCor corrects reinforcement learning issues by re-weighting collected data.

problem Reinforcement learning algorithms struggle with instability and sensitivity to hyperparameters.
method DisCor reweights collected data to mitigate issues caused by the distribution of experience.
result DisCor improves reinforcement learning in challenging settings like multi-task learning and noisy reward signals.

Study uses remotely sensed data to infer economic outcomes in experiments and quasi-experiments.

problem Imperfect measurement of economic outcomes by remotely sensed variables.
method Combines experimental and observational data to identify causal parameters, using satellite imagery and mobile phone activity.
result Developed a robust method for n^{-1/2} inference that does not restrict remotely sensed variable processing algorithms.

We describe our language-independent unsupervised word sense induction system. This system only uses topic features to cluster different word senses in their global context topic space. Using unlabeled data, this system trains a latent Dirichlet allocation (LDA) topic model then uses it to infer the topics distribution…

2013-02-28abs ↗pdf ↗

The paper improves conditions for unique recovery in homomorphic sensing of subspaces.

problem Unique recovery of points in a linear subspace from their images under linear maps.
method Tighter and simpler conditions for unique recovery in single and subspace arrangement cases, extending to noise stability.
result Conditions for unique recovery in homomorphic sensing are improved and unified.

Novel algorithm estimates local permutations in unlabeled multi-view sensing.

problem Estimating local permutations in unlabeled multi-view sensing.
method Graph alignment and Gromov-Wasserstein alignment exploiting multiple views.
result The proposed algorithm is scalable and applicable to challenging SNR regimes.

Paper offers robust recovery for 1-bit sensing with partial Gaussian circulant matrices.

problem Accurately recovering vectors from 1-bit measurements using structured matrices.
method Correlation-based optimization with randomly signed partial Gaussian circulant matrices and generative models.
result Recovery guarantees match those for i.i.d. Gaussian matrices but with faster computation.