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

22456789 · Oct 201919922001200920172026
48 results for excluded area

Study examines the excluded area between two-dimensional hard particles, identifying key factors affecting its magnitude.

problem Determining the excluded area between two-dimensional hard particles with various orientations and shapes.
method Used principal component analysis and Monte Carlo simulations to analyze randomly generated non-self-intersecting polygons and star lines.
result The minimum excluded area is achieved when particles are antiparallel, and elongation of the particle shape significantly affects the excluded area.

We consider embedded, smooth curves in the plane which are either closed or asymptotic to two lines. We study their behaviour under curve shortening flow with a global forcing term. Firstly, we prove an analogue to Huisken's distance comparison principle for curve shortening flow for initial curves whose local total cu…

2018-09-23abs ↗pdf ↗

In this paper we consider minors of ribbon graphs (or, equivalently, cellularly embedded graphs). The theory of minors of ribbon graphs differs from that of graphs in that contracting loops is necessary and doing this can create additional vertices and components. Thus the ribbon graph minor relation is incompatible wi…

2013-11-09abs ↗pdf ↗

We explore to what extent one may hope to preserve geometric properties of three dimensional manifolds with lower scalar curvature bounds under Gromov-Hausdorff and Intrinsic Flat limits. We introduce a new construction, called sewing, of three dimensional manifolds that preserves positive scalar curvature. We then use…

2017-03-02abs ↗pdf ↗

Graphs with bounded anisotropic mean curvature are regular almost everywhere.

problem Understanding the regularity of graphs with anisotropic mean curvature.
method Proving regularity for mm-dimensional Lipschitz graphs with anisotropic mean curvature bounded in LpL^p.
result Graphs with bounded anisotropic mean curvature are regular almost everywhere.

We give a reduction from {\sc clique} to establish that sparse PCA is NP-hard. The reduction has a gap which we use to exclude an FPTAS for sparse PCA (unless P=NP). Under weaker complexity assumptions, we also exclude polynomial constant-factor approximation algorithms.

2015-02-19abs ↗pdf ↗

For the efficient execution of deep convolutional neural networks (CNN) on edge devices, various approaches have been presented which reduce the bit width of the network parameters down to 1 bit. Binarization of the first layer was always excluded, as it leads to a significant error increase. Here, we present the novel…

2018-12-09abs ↗pdf ↗

Deep learning model predicts severe COVID-19 outcomes.

problem Predicting severe COVID-19 outcomes in ED patients.
method Deep feature fusion model using EHR data and CXR images.
result CO-RISK score achieved AUC of 0.95 and 0.92 for 24 and 72 hours predictions, superior to human performance.

Study embeddability of 2-complexes in 4-space, proving Heawood family's excluded minors.

problem Whether a 2-dimensional CW complex embeds in R4\mathbb{R}^4.
method Operations preserving embeddability, constructions of non-preserving transformations, study of 4-flat graphs.
result Prove 78 graphs of Heawood family are excluded minors for 4-flat graphs.

The statistical analysis of discrete data has been the subject of extensive statistical research dating back to the work of Pearson. In this survey we review some recently developed methods for testing hypotheses about high-dimensional multinomials. Traditional tests like the χ2χ^2 test and the likelihood ratio test ca…

2017-12-17abs ↗pdf ↗

New equations reveal how cylinder power in progressive lenses depends on geodesic curvature.

problem Current understanding of cylinder power in progressive lenses is incomplete.
method Derived complete compatibility equations for spatially-varying curvature surfaces.
result Cylinder power depends on geodesic curvature, not just principal curvature.

Fluctuation scaling is observed phenomenon from complex networks through finance to ecology. It means that the variance and the mean of a specific quantity are related as $\ev{σ^2|n}\propto \ev{n|A}^{2α}$ with 1/2α11/2\geq α\geq 1 when a parameter AA (usually the system size) is varied. AA can be the strength of the nod…

2007-03-12abs ↗pdf ↗

New method finds sparse groups of input variables for neural networks.

problem Finding optimal groups of input variables for neural networks.
method Developed a new loss function and optimization algorithm for multi-layer non-linear neural networks to achieve group sparsity.
result Achieved group sparsity in three real-world datasets, improving model performance and excluding a significant number of variables.

The study characterizes embeddable 2-complexes in 3-space.

problem Characterizing embeddable 2-dimensional simplicial complexes in 3-space.
method Characterization through excluded minors and extensions.
result Characterized embeddable 2-complexes in 3-space, including cones over K5K_5 and K3,3K_{3,3}, and related constructions.

This paper argues for decolonizing AI alignment by incorporating open-source Hinduism concepts.

problem Coloniality in AI development and deployment, particularly in alignment practices.
method Proposes three forms of openness: model, societal, and excluded knowledge openness, using Hindu viśe\d{s}a-dharma.
result AI alignment should be decolonialized to avoid moral absolutism and better align with desired values.

Community-based system dynamics improves ML fairness by involving excluded stakeholders.

problem Bias in ML system development during problem formulation.
method Community-based system dynamics (CBSD) for stakeholder participation.
result CBSD facilitates deeper problem understanding and bias mitigation.

Paper excludes the lowest energy level as an accumulation point for harmonic maps into analytic manifolds.

problem Analytic manifolds and their harmonic maps energy spectrum.
method Exclusion of the lowest energy level as an accumulation point using obstructions to the gluing of harmonic spheres and Lojasiewicz-estimates.
result Proves that the lowest energy level is not an accumulation point for generic 3-manifolds.

A method to detect spillover effects and select valid donors for synthetic control models.

problem Identifying valid donors in synthetic control models when spillover effects are possible.
method Theoretical grounding and practical method using pre-intervention data to identify donor values and debias causal estimates.
result A Theorem that identifies assumptions for identifying donor values and debias causal estimates.

Researchers prove a Willmore conjecture for surfaces with specific symmetries.

problem Finding the surface in S3\mathbb S^3 that minimizes the Willmore energy with given topological type.
method Local computation of the orbifold Euler number to exclude certain intersection patterns of surfaces with symmetries.
result Lawson's minimal surface ξg,1S3ξ_{g,1}\subset\mathbb S^3 minimizes the Willmore energy among surfaces of genus g>1g>1 with the same symmetries.

The strong symmetric genus of a finite group G is the smallest genus of a closed orientable topological surface on which G acts faithfully as a group of orientation preserving automorphisms. In this paper we complete the calculation of the strong symmetric genus for each finite Coxeter group excluding the group E8.

2004-11-20abs ↗pdf ↗

Constructs finite element spaces for (p,q)(p,q)-forms, excluding one subspace.

problem Constructing finite element spaces for (p,q)(p,q)-forms.
method Piecewise polynomial finite element spaces for all natural subspaces of (p,q)(p,q)-forms, excluding one subspace.
result Recovers known finite element spaces and introduces new ones.

We investigate the bounded cohomology of Lefschetz fibrations. If a Lefschetz fibration has regular fiber of genus at least 2 and it has at least two distinct vanishing cycles, we show that its Euler class is not bounded. As a consequence, we exclude the existence of negatively curved metrics on Lefschetz fibrations wi…

2001-09-03abs ↗pdf ↗

Line graph transformation aids graph isomorphism tests by excluding challenging graph properties.

problem Limited theoretical understanding of line graph transformation's impact on GNN models.
method Examined CFI and strongly regular graphs, showing line graph transformation helps WL tests distinguish these graphs.
result Line graph transformation aids WL tests in distinguishing challenging graph properties.

We prove an explicit and sharp upper bound for the Castelnuovo-Mumford regularity of an FI-module V in terms of the degrees of its generators and relations. We use this to refine a result of Putman on the stability of homology of congruence subgroups, extending his theorem to previously excluded small characteristics a…

2015-06-02abs ↗pdf ↗

Study certifies missed relevant items in candidate generation with audit labels.

problem Certify missed relevant items in candidate generation with audit labels.
method Characterizes label complexity, develops exact finite-sample toolkit.
result Excluded-pool auditing is minimax rate-optimal for missed-mass certification.

Partial soft-matching distance improves neural representation comparison by allowing some neurons to remain unmatched.

problem Neural representations are noisy and contain outliers, making traditional matching methods unreliable.
method Extends soft-matching distance to a partial optimal transport setting, allowing some neurons to remain unmatched.
result Partial soft-matching provides robust correspondences that are more reliable under noise and outliers.

Graphs with fat minors have a limited large-scale structure.

problem Understanding the large-scale structure of graphs excluding certain minors.
method Introduced the concept of Baker-treewidth and used it to prove asymptotic dimension bounds.
result Every hereditary class of bounded-degree graphs excluding some graph as a fat minor has asymptotic dimension at most 2.

Decoding strategies often exclude human-like tokens, creating a detectable gap in generated text.

problem Decoding strategies exclude contextually appropriate but statistically rare tokens, creating a detectable gap in generated text.
method Analysis of 1.8 million texts across 8 language models, 5 decoding strategies, and 53 hyperparameter configurations.
result 8-18% of human-selected tokens fall outside typical truncation boundaries, indicating a detectable gap.

Study on inventory management under uncertainty using smooth ambiguity preference.

problem Managing inventory under Knightian uncertainty with smooth ambiguity preference.
method Demonstrates continuous-time smooth ambiguity as the infinitesimal limit of Kalman-Bucy filtering with recursive robust utility. Solves forward-backward stochastic differential equations with quadratic growth to determine cost function. Derives value function and optimal control policy using variational inequalities and viscosity solutions. Transforms problem into two-dimensional singular control.
result Ambiguity drives decision-makers to act earlier, reducing the continuation region.

Because of the prominent position of urban rail in reducing urban transport-related problems, such as congestion and air pollution, insights into the costs of possible new urban rail projects is very relevant for those involved with cost estimations, policy makers, cost-benefit analysts, and other target groups. Knowle…

2013-03-20abs ↗pdf ↗

Fast method estimates variable importance for large neural networks.

problem Estimating variable importance in large neural networks is computationally expensive and lacks theoretical guarantees.
method Linearization initialized at full model parameters with ridge-like penalty.
result Estimates variable importance with error rate of O(1n)O(\frac{1}{\sqrt{n}}) and asymptotic normality.

The aim of this paper is to collect some facts about the blowup of Jang's equation. First, we discuss how to construct solutions that blow up at an outermost MOTS. Second, we exclude the possibility that there are extra blowup surfaces in data sets with non-positive mean curvature. Then we investigate the rate of conve…

2007-11-29abs ↗pdf ↗

Study no-arbitrage conditions in 1D diffusion markets with interest rates.

problem Determining no-arbitrage conditions in 1D diffusion markets with interest rates.
method Established deterministic criteria for no-arbitrage notions in terms of scale function and speed measure.
result Revealed various effects, e.g., NIP not excluded by reflecting boundaries.