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

51102153204 · Jun 202019922001200920172026
48 results for region embeddings

Improved object detection for scientific document images.

problem Current object detectors fail to accurately localize regions in scientific document images.
method Revised R-CNN model with region embedding for fine-grained proposals.
result 17% mAP improvement over standard object detection models.

The study proves the existence of free boundary minimal disks in convex regions.

problem Proving the existence of free boundary minimal disks in convex regions.
method Based on a multiplicity-one theorem for the free boundary Simon-Smith min-max theory.
result Existence of at least three embedded free boundary minimal disks in strictly convex domains with nonnegative Ricci curvature.

ViCE uses superpixels to enhance self-supervised learning for better dense visual embeddings.

problem Lack of high-resolution feature maps from self-supervised models.
method Superpixels for dense representation learning, contrasting over regions.
result Improves unsupervised semantic segmentation on benchmarks like Cityscapes and COCO.

We consider embeddings of 3-manifolds in S4S^4 such that each of the two complementary regions has an abelian fundamental group. In particular, we show that an homology handle MM has such an embedding if and only if π1(M)π_1(M)' is perfect, and that the embedding is then essentially unique.

2017-07-03abs ↗pdf ↗

An embedding of a metric graph (G,d)(G, d) on a closed hyperbolic surface is \emph{essential}, if each complementary region has a negative Euler characteristic. We show, by construction, that given any metric graph, its metric can be rescaled so that it admits an essential and isometric embedding on a closed hyperbolic su…

2017-03-07abs ↗pdf ↗

We introduce a new multi-dimensional nonlinear embedding -- Piecewise Flat Embedding (PFE) -- for image segmentation. Based on the theory of sparse signal recovery, piecewise flat embedding with diverse channels attempts to recover a piecewise constant image representation with sparse region boundaries and sparse clust…

2018-02-09abs ↗pdf ↗

Given a smooth polarized Riemann surface (X, L) endowed with a hyperbolic metric ωω with cusp singularities along a divisor D, we show the L^2 projective embedding of (X, D) defined by L^k is asymptotically almost balanced in a weighted sense. The proof depends on sufficiently precise understanding of the behavior of …

2016-05-03abs ↗pdf ↗

Graph embeddings from commute networks identify socioeconomic disparities in urban areas.

problem Urban delineation and socioeconomic group identification.
method Graph Neural Network (GNN) for modeling commute networks and deriving node embeddings.
result GNNs effectively capture socioeconomic disparities between urban communities.

In this paper we provide a large new family of embedded capillary surfaces inside polyhedral regions in the Euclidean space. The angle of contact of the examples we furnish is prescribed to be any value in (π2,π](\fracπ{2}, π] and it is allowed to vary from one boundary component to the other.

2014-01-27abs ↗pdf ↗

We measure, in two distinct ways, the extent to which the boundary region of moduli space contributes to the ``simple type'' condition of Donaldson theory. Using a geometric representative of μ(pt), the boundary region of moduli space contributes 6/64 of the homology required for simple type, regardless of the topology…

1997-12-22abs ↗pdf ↗

A leveraged exchange traded fund (LETF) is an exchange traded fund that uses financial derivatives to amplify the price changes of a basket of goods. In this paper, we consider the robust hedging of European options on a LETF, finding model-free bounds on the price of these options. To obtain an upper bound, we establi…

2017-02-23abs ↗pdf ↗

Diffusion maps are a commonly used kernel-based method for manifold learning, which can reveal intrinsic structures in data and embed them in low dimensions. However, as with most kernel methods, its implementation requires a heavy computational load, reaching up to cubic complexity in the number of data points. This l…

2019-01-31abs ↗pdf ↗

LASE improves local network structure visualization by targeting locally low-dimensional regions.

problem Global spectral embedding fails to capture local geometric features in sparse, transitive networks.
method Local Adjacency Spectral Embedding (LASE) using weighted spectral decomposition.
result LASE reveals locally low-dimensional structure, improving local reconstruction and visualization.

New algorithm quantifies uncertainty in regression models for complex data types.

problem Uncertainty quantification in regression models for complex data types.
method Model-free uncertainty quantification algorithm based on conditional depth measures and kernel mean embeddings.
result Provides faster convergence rates and non-asymptotic guarantees for prediction regions.

This is an expository article, explaining recent work by D. Groisser and myself [GS] on the extent to which the boundary region of moduli space contributes to the ``simple type'' condition of Donaldson theory. The presentation is intended to complement [GS], presenting the essential ideas rather than the analytical det…

1997-12-22abs ↗pdf ↗

We give several generalizations of the Kodaira vanishing and embedding theorems for Kähler manifolds to the case where the relevent line bundle has a small region of negative curvature. To prove the vanishing theorems we adapt techniques of Elworthy-Rosenberg for vanishing theorems in Riemannian geometry. For the embed…

1995-02-02abs ↗pdf ↗

Study integrates reliability constraints into generation planning models.

problem Challenges in integrating reliability constraints with generation planning models.
method Leverages a weighted oblique decision tree (WODT) technique to embed reliability verification constraints.
result Demonstrates effectiveness in achieving reliable and optimal planning solutions.

Proposes a text perturbation method using a Mahalanobis metric to balance privacy and utility.

problem Low utility of text analysis when using spherical noise for privacy-preserving text embedding.
method Regularized Mahalanobis metric to add elliptical noise, accounting for embedding space density.
result Improves privacy statistics while maintaining utility, outperforming Laplace mechanism.

sBayFDNN bridges deep learning and functional data analysis for complex, structured data.

problem Challenges in functional data analysis, especially for complex, continuously structured data.
method Sparse Bayesian functional deep neural network (sBayFDNN) that learns adaptive functional embeddings and interpretable region selection.
result First theoretical guarantees for a Bayesian deep functional model, ensuring reliability and statistical rigor.

The paper forecasts joint electricity demand across 14 British regions using additive models.

problem Forecasting regional electricity demand with cross-regional dependencies.
method Modified Cholesky parametrisation for multivariate Gaussian model, gradient boosting for model selection.
result The proposed model outperforms non-Gaussian copula-based models in forecasting.

End-to-end pipeline for data-driven decision making in mixed-integer optimization.

problem Data-driven decision making in mixed-integer optimization with uncertainty.
method Exploiting mixed-integer optimization-representability of machine learning methods, characterizing decision trust regions, and ensembling multiple models.
result Framework generates high-quality prescriptions and controls model robustness.

DBGDGM models dynamic brain graphs for better understanding brain function.

problem Previous brain graph models ignore temporal dynamics, limiting their usefulness.
method DBGDGM clusters brain regions into evolving communities and learns dynamic node embeddings.
result DBGDGM outperforms baselines in graph generation, dynamic link prediction, and graph classification.

Donor-aware scRNA-seq benchmarks improve classification accuracy in inflammatory bowel disease.

problem Influenza disease classification from scRNA-seq data is prone to donor-level confounding.
method Developed and evaluated three feature representations across two IBD cohorts.
result Compartment-stratified CLR composition and GatedStructuralCFN embeddings outperform linear models in classification accuracy.

Deep metric learning algorithms have been utilized to learn discriminative and generalizable models which are effective for classifying unseen classes. In this paper, a novel noise tolerant deep metric learning algorithm is proposed. The proposed method, termed as Density Aware Metric Learning, enforces the model to le…

2019-04-08abs ↗pdf ↗

We prove that every plane passing through the origin divides an embedded compact free boundary minimal surface of the euclidean 33-ball in exactly two connected surfaces. We also show that if a region in the ball has mean convex boundary and contains a nullhomologous diameter, then this region is a closed halfball. Mo…

2019-07-09abs ↗pdf ↗

The study embeds graphs on translation surfaces, proving essential-systolic embeddings and estimating surface genera.

problem Embedding graphs on translation surfaces with specific properties.
method Proving essential-systolic embeddings and estimating surface genera.
result Finite graphs admit essential-systolic embeddings on translation surfaces with estimated genera.

In order to model entanglements of polymers in a confined region, we consider the linking numbers and writhes of cycles in random linear embeddings of complete graphs in a cube. Our main results are that for a random linear embedding of KnK_n in a cube, the mean sum of squared linking numbers and the mean sum of square…

2015-08-05abs ↗pdf ↗

In this short article we investigate the topology of the moduli space of two-convex embedded tori Sn1×S1Rn+1S^{n-1}\times S^1\subset \mathbb{R}^{n+1}. We prove that for n3n \geq 3 this moduli space is path-connected, and that for n=2n = 2 the connected components of the moduli space are in bijective correspondence with the knot…

2017-03-06abs ↗pdf ↗

New analysis shows rational actors will deploy AGI despite negative social value due to catastrophic risk.

problem Rational actors will deploy AGI despite negative social value due to shared catastrophic risk.
method Continuous-time preemption game with shared catastrophic externalities, showing suicide region and welfare distortion.
result The suicide region widens as catastrophic risk grows, and two mechanisms can close it.

BN refines local partition geometry in piecewise-affine networks during training.

problem Understanding the effect of BN on the function realized during training in piecewise-affine networks.
method Analyzing the geometry of switching hyperplanes and affine-region partition conditioned on a mini-batch.
result BN increases expected local partition refinement in ReLU and piecewise-affine networks.

SOCP uses SOM to find groups and local calibration buffers for better regional coverage.

problem Heterogeneous regional coverage gaps in conformal prediction.
method Self-Organizing Map (SOM) for group discovery; local calibration buffers at BMU or fixed grid.
result Reduces regional coverage gaps on 7/8 benchmarks by 7.1%.

We propose the Graph Space Embedding (GSE), a technique that maps the input into a space where interactions are implicitly encoded, with little computations required. We provide theoretical results on an optimal regime for the GSE, namely a feasibility region for its parameters, and demonstrate the experimental relevan…

2019-07-31abs ↗pdf ↗

We study the quasi-local energy (QLE) and the surface geometry for Kerr spacetime in the Boyer-Lindquist coordinates without taking the slow rotation approximation. We also consider in the region r2mr\leq2m, which is inside the ergosphere. For a certain region, r>rk(a)r>r_{k}(a), the Gaussian curvature of the surface with co…

2016-06-27abs ↗pdf ↗

Develops methods to analyze feature-outcome associations in subpopulations.

problem Challenges in understanding feature-outcome associations in high-dimensional data.
method Geometric decomposition framework using gradient flow and co-monotonicity decomposition.
result Identifies context-dependent patterns and improves statistical power and interpretability.