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

199397596794 · Jun 202019922001200920172026
48 results for H-minimizing sets

In this paper we investigate H-minimal graphs of lower regularity. We show that noncharactersitic C^1 H-minimal graphs whose components of the unit horizontal Gauss map are in W^{1,1} are ruled surfaces with C^2 seed curves. In a different direction, we investigate ways in which patches of C^1 H-minimal graphs can be g…

2005-05-13abs ↗pdf ↗

Hamiltonian minimality (H-minimality) for Lagrangian submanifolds is a symplectic analogue of Riemannian minimality. A Lagrangian submanifold is called H-minimal if the variations of its volume along all Hamiltonian vector fields are zero. This notion was introduced in the work of Y.-G. Oh in connection with the celebr…

2013-01-12abs ↗pdf ↗

We prove some stability results for smooth H-minimal hypersurfaces immersed in a sub-Riemannian k-step Carnot group G. The main tools are the formulas for the 1st and 2nd variation of the H-perimeter measure.

2012-03-27abs ↗pdf ↗

Corrected Monti's blow-up analysis for H-minimizing sets in Heisenberg group.

problem Blow-up analysis of H-minimizing sets in Heisenberg group with corrected partial differential equation.
method Revised Monti's results on blow-ups of H-perimeter minimizing sets in Hn\mathbb{H}^n and corrected the partial differential equation for the limit function.
result Corrected the partial differential equation for the limit function of blow-ups in Heisenberg group.

The paper studies harmonic graphs in the Heisenberg group and their properties.

problem No analogous theorem exists for HH-minimal surfaces in the Heisenberg group.
method Introduced intrinsic Dirichlet energy and studied its critical points (contact harmonic graphs).
result Calibration condition and construction of energy-minimizing graphs with various singularities.

We establish the following theorem of Bernstein type for the first Heisenberg group: Let S be a C^2 connected H-minimal surface which is a graph over some plane P, then S is either a non-characteristic vertical plane, or its generalized seed curve satisfies a type of constant curvature condition.

2002-09-06abs ↗pdf ↗

In this paper we investigate a family of Hamiltonian-minimal Lagrangian submanifolds in Cm{\mathbb C}^m, CPm{\mathbb C}P^m and other symplectic toric manifolds constructed from intersections of real quadrics. In particular, we explain the nature of this phenomenon by proving H-minimality in a more conceptual way, and pr…

2013-07-30abs ↗pdf ↗

For Lorentzian 2-manifolds (Σ1,g1)(Σ_1,g_1) and (Σ2,g2)(Σ_2,g_2) we consider the two product para-Kähler structures (Gε,J,Ωε)(G^ε,J,Ω^ε) defined on the product four manifold Σ1×Σ2Σ_1\timesΣ_2, with ε=±1ε=\pm 1. We show that the metric GεG^ε is locally conformally flat (resp. Einstein) if and only if the Gauss curvatures κ1,κ2κ_1,κ_2 of $g_1,g_…

2014-03-03abs ↗pdf ↗

The paper analyzes set-to-set matching with neural networks, focusing on theoretical generalization.

problem Theoretical analysis of set-to-set matching with neural networks.
method Generalization error analysis of set-to-set matching with neural networks.
result Theoretical insights into the behavior of set-to-set matching models.

Generative model learns to autoencode and generate sets of images.

problem Learning to represent and generate sets of images with unknown number of sets.
method Set Distribution Networks (SDNs) learn set encoder, discriminator, generator, and prior.
result SDNs can reconstruct and generate sets of images with preserved attributes.

Matching two different sets of items, called heterogeneous set-to-set matching problem, has recently received attention as a promising problem. The difficulties are to extract features to match a correct pair of different sets and also preserve two types of exchangeability required for set-to-set matching: the pair of …

2019-10-22abs ↗pdf ↗

Maps sets to probability distributions to minimize information loss.

problem Learning to map sets to probability distributions to preserve information.
method Relates set operations to probability distribution interpolations and demonstrates a preliminary solution.
result Experimental results show the effectiveness of the set embedding approach.

New set-valued star-shaped risk measures introduced for better risk assessment.

problem Improving risk assessment in financial contexts.
method Developed new set-valued star-shaped risk measures and proved their representation theorems.
result Set-valued star-shaped risk measures can be represented as unions of set-valued convex risk measures.

We introduce the concept of hereditarily non uniformly perfect sets, compact sets for which no compact subset is uniformly perfect, and compare them with the following: Hausdorff dimension zero sets, logarithmic capacity zero sets, Lebesgue 2-dimensional measure zero sets, and porous sets. In particular, we give an exa…

2016-09-23abs ↗pdf ↗

Current approaches for predicting sets from feature vectors ignore the unordered nature of sets and suffer from discontinuity issues as a result. We propose a general model for predicting sets that properly respects the structure of sets and avoids this problem. With a single feature vector as input, we show that our m…

2019-06-15abs ↗pdf ↗

This paper studies the geometry of minimum-volume confidence sets for multinomial parameters.

problem Determining if minimum-volume confidence sets for multinomial outcomes are disjoint.
method Enumerating and covering the continuous regions of the exact p-value function to study the geometry of minimum-volume confidence sets.
result The geometry of minimum-volume confidence sets for multinomial parameters is studied, providing insights into their structure and properties.

Consider a general machine learning setting where the output is a set of labels or sequences. This output set is unordered and its size varies with the input. Whereas multi-label classification methods seem a natural first resort, they are not readily applicable to set-valued outputs because of the growth rate of the o…

2019-03-12abs ↗pdf ↗

Deep Sets approximates functions on sets with high-dimensional latent space.

problem Modeling functions of sets (permutation-invariant functions).
method Deep Sets, a method known to be a universal approximator for continuous set functions.
result Deep Sets' universal approximation property is only guaranteed with a sufficiently high-dimensional latent space.

Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.

problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.

A stability-based method selects the most desirable conformal prediction set.

problem Selecting the most desirable conformal prediction set from multiple valid sets invalidates coverage guarantees.
method A stability-based approach that ensures coverage for the selected prediction set.
result The stability-based approach maintains coverage guarantees for the selected prediction set.

This work establishes properties on diffeological structures for set-valued maps and measures.

problem Establish rigorous properties on diffeological structures for set-valued maps and measures.
method Using diffeologies, the authors link various structures including set-valued maps, relations, gradients, measures, and shape analysis.
result Established rigorous properties on sample diffeologies.

Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.

problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.

Representations of sets are challenging to learn because operations on sets should be permutation-invariant. To this end, we propose a Permutation-Optimisation module that learns how to permute a set end-to-end. The permuted set can be further processed to learn a permutation-invariant representation of that set, avoid…

2018-12-10abs ↗pdf ↗

Proves a theorem for Assouad dimension with applications to distance sets and radial projections.

problem Problems related to Assouad dimension and distance sets.
method General nonlinear projection theorem for Assouad dimension.
result Sharp estimates for sets with Assouad dimension less than 1 and exceptional set estimates.

The paper explores connections between perimeter, area, and visual angle of convex sets.

problem Understanding geometric properties of convex sets through visual angle and related measurements.
method Establishing universal formulas and characterizing convex sets of constant width.
result Crofton's formula is the unique universal formula relating visual angle, length, and area.

The paper defines cyclic sets from ribbon string links and connects them to quantum invariants.

problem Defining and relating cyclic sets from ribbon string links.
method Endowing ribbon string links with cyclic and cocyclic structures, relating to coend of a ribbon category via quantum invariants.
result Established a relationship between ribbon string links and quantum invariants.