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

54109163217 · Jun 202019922001200920172026
48 results for critical density

Method reconstructs financial networks from aggregate data, revealing critical link density.

problem Reconstructing financial networks from aggregate data is challenging due to unreconstructability phases.
method Random graph generation with desired link density and replicated constraints.
result There is a critical link density below which networks become unreconstructable.

Sharp lower bound found for integral varifolds' mean curvature.

problem Finding a sharp lower bound for the mean curvature integral of integral varifolds.
method Developed a new approach using integral varifolds and mean curvature.
result A sharp lower bound on the mean curvature integral with critical power for integral varifolds.

New algorithm reduces bias in off-policy reinforcement learning.

problem Challenges in designing off-policy reinforcement learning algorithms.
method Doubly robust off-policy actor-critic (DR-Off-PAC) with a single timescale structure.
result Establishes the first overall sample complexity analysis for a single time-scale off-policy AC algorithm.

We prove the existence and uniqueness of a *projectively equivariant symbol map*, which is an isomorphism between the space of bidifferential operators acting on tensor densities over RnR^n and that of their symbols, when both are considered as modules over an imbedding of sl(n+1,R)sl(n+1,\R) into polynomial vector fields. Th…

2000-06-07abs ↗pdf ↗

The integral of the energy density function m\mathfrak m of a closed Robertson-Walker (RW) spacetime with source a perfect fluid and cosmological constant ΛΛ gives rise to an action functional on the space of scale functions of RW spacetime metrics. This paper studies closed RW spacetimes which are critical for this …

2019-04-18abs ↗pdf ↗

Paper proves minimal resistance for a body in a fluid with decreasing density.

problem Minimal resistance for a body moving through a fluid with non-constant density.
method Local existence and regularity of radial solutions using a fixed-point theorem.
result Maximal domain of the solution is finite, terminating at a critical slope.

Proposes a new feature preprocessing method using kernel density integral transformation.

problem Feature preprocessing for tabular data in machine learning and statistics.
method Kernel density integral transformation as a drop-in replacement or improved alternative to min-max scaling and quantile transformation.
result Frequently outperforms min-max scaling and quantile transformation with hyperparameter tuning.

This paper presents a method for efficient density estimation in nonlinear systems.

problem Accurate representation of non-Gaussian distributions in nonlinear dynamical systems is challenging.
method Uses Seminonparametric (SNP) densities with probabilists' Hermite polynomial basis and Monte Carlo approximation for maximum likelihood estimation.
result Demonstrates that the method can accurately capture non-Gaussian density structure and compute quantiles using fewer samples than raw Monte Carlo.

The paper tackles MAP inference over non-convex constraints in safety-critical settings.

problem Efficiently computing MAP predictions subject to non-convex constraints is challenging.
method The paper investigates conditions for exact and efficient MAP inference over continuous variables and devises scalable algorithms for both tractable and general cases.
result The proposed methods outperform constraint-agnostic baselines and scale to complex densities.

This paper proposes a new method for automatically selecting the optimal kernel bandwidth in density estimation.

problem The challenge of selecting the optimal kernel bandwidth in unsupervised density estimation.
method The approach uses a topology-based loss function for automated bandwidth selection.
result Demonstrates the potential of the topology-based approach across different dimensions.

For Ginzburg-Landau vortices, energy quantization holds only when density is less than 2.

problem Energy quantization in Ginzburg-Landau vortices for higher dimensions.
method Analyzing normalized energy measures and vorticity sets.
result Energy quantization only holds when density is less than 2.

Quantifies how geodesic planes isolate in hyperbolic 3-manifolds.

problem Understanding isolation properties of geodesic planes in hyperbolic 3-manifolds.
method Quantitative estimates of geodesic planes in frame bundles, using tight areas and densities.
result Polynomial estimates of isolation properties with degree given by modified critical exponents.

We prove a generalization of the fundamental inequality of Guivarc'h relating entropy, drift and critical exponent to Gibbs measures on geometrically finite quotients of CAT(-1) metric spaces. For random walks with finite superexponential moment, we show that the equality is achieved if and only if the Gibbs density is…

2019-04-02abs ↗pdf ↗

Paper tackles unbounded density ratio estimation for covariate shift adaptation.

problem Understudied challenge in statistical learning: unbounded density ratios.
method Three-step estimation method: relative density ratio, truncation, and transformation.
result Established rigorous convergence guarantees for density ratio and regression estimators.

Modeling complex conditional distributions is critical in a variety of settings. Despite a long tradition of research into conditional density estimation, current methods employ either simple parametric forms or are difficult to learn in practice. This paper employs normalising flows as a flexible likelihood model and …

2018-02-14abs ↗pdf ↗

Detects which features have shifted in data distributions.

problem Identifying which specific features have caused a distribution shift.
method Formalizes the problem as multiple conditional distribution hypothesis tests, proposes non-parametric and parametric statistical tests, and uses a test statistic based on the density model score function.
result Demonstrates methods for identifying when and where a shift occurs in multivariate time-series data.

Bayesian DDR models complex multivariate distributions.

problem Modeling relationships between multivariate distributions with differing dimensions.
method Generalized Bayesian framework using sliced Wasserstein distance and MALA for inference.
result Posterior consistency and robust fits demonstrated in simulations and real data.

We prove the existence and the uniqueness of a conformally equivariant symbol calculus and quantization on any conformally flat pseudo-Riemannian manifold $(M,\rg)$. In other words, we establish a canonical isomorphism between the spaces of polynomials on TMT^*M and of differential operators on tensor densities over $M…

1999-02-04abs ↗pdf ↗

Proposes a method to partition univariate data into unimodal subsets.

problem Partitioning univariate multimodal data into unimodal subsets.
method Recursive splitting around valley points of the data density using properties of critical points on the convex hull of the ecdf plot.
result Obtains a hierarchical statistical model of the initial dataset as a mixture of UMMs.

We identify 'critical windows' in diffusion models where specific features emerge, providing a theoretical framework.

problem Understanding narrow time intervals in diffusion models where specific features emerge.
method Developed a formal framework to study these critical windows, showing provable bounds for certain data types.
result Proved that critical windows can be bounded in terms of measures of separation for data from mixtures of log-concave densities.

Equivariant graph neural networks predict electron density for molecules, liquids, and solids.

problem Predicting electron density for molecules, liquids, and solids using machine learning.
method Equivariant graph neural networks for predicting electron density at query points.
result The model predicts electron density with accuracy beyond state of the art and significantly faster than traditional DFT methods.

Machine learning predicts critical points for directed percolation models.

problem Determining critical points for directed percolation models.
method Supervised and unsupervised machine learning algorithms (CNN and DBSCAN) were used.
result Machine learning accurately predicts critical points for both models.

Direct Density Ratio Optimization aligns LLMs with human preferences without assuming specific models.

problem Statistical inconsistency in aligning LLMs with human preferences.
method Direct Density Ratio Optimization (DDRO) estimates density ratio directly.
result DDRO is statistically consistent, converging to true human preferences as data grows.

Paper provides estimates for varifolds with critical mean curvature.

problem Estimating tilt-excess on varifolds with critical mean curvature.
method Generalizing Lipschitz approximation and Sobolev-Poincaré estimates to almost-integral rectifiable varifolds.
result VMO-type estimates for quadratic tilt-excess on varifolds with critical mean curvature.

The study finds anisotropic minimal surfaces in 3-manifolds with smooth boundaries.

problem Finding smooth anisotropic minimal surfaces in closed 3-manifolds.
method Min-max construction with elliptic integrands, uniform upper bound for density ratios.
result Obtains a smooth anisotropic minimal surface in a closed 3-manifold.

We propose a nonparametric statistical test for goodness-of-fit: given a set of samples, the test determines how likely it is that these were generated from a target density function. The measure of goodness-of-fit is a divergence constructed via Stein's method using functions from a Reproducing Kernel Hilbert Space. O…

2016-02-09abs ↗pdf ↗

Efficient algorithms find solutions in a rare well-connected cluster at low constraint densities.

problem Finding solutions in the symmetric binary perceptron at low density.
method Formal proof of existence of a subdominant connected cluster and application of an efficient multiscale majority algorithm.
result An efficient algorithm can find solutions in a subdominant connected cluster with high probability.