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

Trend · papers per month

72144215287 · Jun 202019922001200920172026
48 results for extremal domains

The paper studies stability of domains for the first eigenvalue on Riemannian manifolds.

problem Stability of extremal domains for the first eigenvalue of the Laplacian operator.
method Second variation of the first Dirichlet eigenvalue, stability criterion, classification of stable domains.
result Classification of stable extremal domains in spheres and topological bounds for general compact surfaces.

We investigate the geometry and topology of extremal domains in a manifold with negative sectional curvature. An extremal domain is a domain that supports a positive solution to an overdetermined elliptic problem (OEP for short). We consider two types of OEPs. First, we study narrow properties of such domains in a Hada…

2015-04-28abs ↗pdf ↗

The paper examines geometric properties of domains for the p-Laplacian in Euclidean and hyperbolic spaces.

problem Exploring geometric properties of unbounded extremal domains for the p-Laplacian operator.
method Analyzing properties in Euclidean and hyperbolic spaces, proving constraints on domains and their asymptotic boundaries.
result Extremal domains in two dimensions must be balls, and in hyperbolic space, they have specific geometric constraints.

An nn-dimensional Hartogs domain DFD_F with strongly pseudoconvex boundary can be equipped with a natural \K metric gFg_F. In this paper we prove that if gFg_F is an extremal \K metric then (DF,gF)(D_F, g_F) is biholomorphically isometric to the nn-dimensional complex hyperbolic space.

2007-05-15abs ↗pdf ↗

Paper tackles open set domain adaptation by detecting unknown classes.

problem Adapting to target domains with unknown classes when label spaces partially overlap.
method Instance-level reweighting strategy combined with Extreme Value Theory for unknown class detection.
result Proposed method outperforms state-of-the-art models on conventional datasets.

New framework assesses extreme errors in machine learning models.

problem Current validation methods fail to quantify extreme errors in high-stakes domains.
method Uses Extreme Value Theory (EVT) to estimate worst-case failures.
result Establishes EVT as a fundamental tool for assessing model reliability.

Researchers identify valid auxiliary functions for extreme value distributions and their max-domains of attraction.

problem Characterize valid auxiliary functions for extreme value distributions and their max-domains of attraction.
method Introduced 'universal' auxiliary functions valid for both VR and vMR representations, identified sets of valid auxiliary functions, and proposed a method for finding appropriate auxiliary functions.
result Characterized valid auxiliary functions for both VR and vMR representations for the entire MDA distribution families.

The study examines special domains in S^2 supporting specific solutions to a PDE.

problem Identifying special domains in S^2 supporting positive solutions to a PDE.
method Extends moving plane method and Alexandrov reflection method to prove symmetry.
result Domains must be rotationally symmetric under specific conditions.

Three distinct 3D components found in local extremal Kähler metrics.

problem Characterizing extremal Kähler metrics in one dimension.
method Defined local extremal Kähler metrics and analyzed their germs.
result Space of germs of local extremal Kähler metrics in one dimension comprises three distinct R3{\Bbb R}^3 components.

The paper finds minimum Steklov eigenvalues on combinatorial graphs.

problem Finding the minimum Steklov eigenvalues on combinatorial graphs.
method Extending Friedman's nodal domain theory for Laplacian eigenfunctions to Steklov eigenfunctions.
result The minimum of the imthi^{ m th} Steklov eigenvalue on a connected combinatorial graph is essentially attained by a star or a regular comb with minimal brooms.

RDLI integrates domain logic and context grounding to detect crypto anomalies under scarce labels.

problem Extreme label scarcity and evasion strategies in crypto networks.
method Relational Domain Logic Integration (RDLI) with Retrieval Grounded Context (RGC).
result RDLI outperforms GNN baselines by 28.9% in F1 score under 0.01% label scarcity.

The paper tackles extrapolation in extreme regions of regression problems.

problem Extrapolation on the tails of covariates in continuous regression problems.
method Statistical regression on a subsample of furthest observations, focusing on their angular components, using multivariate regular variation theory.
result Quantifies predictive performance on tail regions in terms of excess risk, presenting it as a finite sample risk bound with a bias-variance decomposition.

Discrete analogues of classical spectral geometric inequalities and extremal eigenvalue problems on graphs.

problem Extremal eigenvalue problems on graphs
method Developing nodal domain methods for adjacency matrices
result Establishing sharp extremal characterizations across diverse graph classes

Framework reconstructs missing spatio-temporal data for extreme value prediction.

problem Predicting extreme values from incomplete spatio-temporal data.
method Convolutional deep neural networks and autoencoder-like models for conditional sampling.
result Framework produces accurate reconstructions of missing data for extremal values.

In this paper we address two problems concerning a family of domains $M_Ω(μ) \subset \C^n$, called Cartan-Hartogs domains, endowed with a natural Kaehler metric g(μ)g(μ). The first one is determining when the metric g(μ)g(μ) is extremal (in the sense of Calabi), while the second one studies when the coefficient a2a_2 in th…

2011-04-29abs ↗pdf ↗

Using generalized Riemann maps, normal forms for almost complex domains (D, J) with singular foliations by stationary disks are defined. Such normal forms are used to construct counterexamples and to determine intrinsic conditions, under which the stationary disks are extremal disks for the Kobayashi metric or determin…

2011-03-28abs ↗pdf ↗

In this paper, we show that the convex domains of the hyperbolic space which are almost extremal for the Faber-Krahn or the Payne-Polya-Weinberger inequalities are close to geodesic balls. Our proof is also valid in other space forms and allows us to recover known results in Euclidean space and on the sphere.

2006-04-26abs ↗pdf ↗

In this paper, we propose a verified numerical method for obtaining a sharp inclusion of the best constant for the embedding H01(Ω)Lp(Ω)H_{0}^{1}(Ω) \hookrightarrow L^{p}(Ω) on bounded convex domain in R2\mathbb{R}^{2}. We estimate the best constant by computing the corresponding extremal function using a verified numerical com…

2015-03-18abs ↗pdf ↗

A novel model combines deep learning and extreme value theory for multivariate cyber risk prediction.

problem High dimensionality and heavy tails in multivariate cyber risk patterns.
method Combines deep learning for point predictions and extreme value theory for quantile predictions.
result The model provides satisfactory high quantile predictions and accurate point predictions.

Recent years, transfer learning has attracted much attention in the community of machine learning. In this paper, we mainly focus on the tasks of parameter transfer under the framework of extreme learning machine (ELM). Unlike the existing parameter transfer approaches, which incorporate the source model information in…

2018-09-04abs ↗pdf ↗

We generalize the Riesz potential of a compact domain in Rm\mathbb{R}^{m} by introducing a renormalization of the rαmr^{α-m}-potential for α0α\le0. This can be considered as generalization of the dual mixed volumes of convex bodies as introduced by Lutwak. We then study the points where the extreme values of the (renorm…

2010-08-16abs ↗pdf ↗

Paper examines risk measure expansions under FGM dependence, improving accuracy at extreme levels.

problem Capturing higher-order tail behavior and dependence effects in risk measures.
method Second-order asymptotic expansions using extreme value theory and regular variation theory.
result Second-order approximations reduce approximation errors, especially at extreme confidence levels.

For a given lattice, we establish an equivalence involving a closed zone of the corresponding Voronoi polytope, a lamina hyperplane of the corresponding Delaunay partition and a quadratic form of rank 1 being an extreme ray of the corresponding L-type domain.

2000-04-01abs ↗pdf ↗

New conditions ensure Dantzig-Wolfe relaxation matches rank-constrained optimization problems.

problem Rank-constrained optimization problems with linear matrix inequalities.
method Investigates Dantzig-Wolfe relaxation and develops conditions for exactness.
result Conditions for extreme point, convex hull, and objective exactness.

CSD learns a common component for domain generalization, outperforming existing methods.

problem Training models to generalize across unseen domains.
method CSD decomposes the model into a common and specific component, discarding the latter.
result CSD outperforms state-of-the-art domain generalization methods.

REx tackles distributional shift by reducing risk differences across domains.

problem Tackling distributional shift when transferring machine learning systems to real-world applications.
method Risk Extrapolation (REx) assumes training domains represent test-time variations and uses extrapolated domains to minimize risk variance.
result REx reduces sensitivity to extreme distributional shifts, including causal and anti-causal inputs.

In this paper we study a sharp Hardy-Littlewood-Sobolev (HLS) type inequality with Riesz potential on bounded smooth domains. We obtain the inequality for a general bounded domain ΩΩ and show that if the extension constant for ΩΩ is strictly larger than the extension constant for the unit ball B1B_1 then extremal fun…

2017-09-12abs ↗pdf ↗

We give a sharp lower bound on the area of the domain enclosed by an embedded curve lying on a two-dimensional sphere, provided that geodesic curvature of this curve is bounded from below. Furthermore, we prove some dual inequalities for convex curves whose curvatures are bounded from above.

2016-05-30abs ↗pdf ↗

An nn-dimensional Hartogs domain DFD_F with strongly pseudoconvex boundary can be equipped with a natural Kaehler metric gFg_F. This paper contains two results. In the first one we prove that if gFg_F is an extremal Kaehler metric then (DF,gF)(D_F, g_F) is holomorphically isometric to an open subset of the nn-dimensional …

2008-05-09abs ↗pdf ↗