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

Trend · papers per month

4693139185 · Jun 202019922001200920182026
48 results for relative comparisons

CV inference can be invalid for relatively unstable model comparisons.

problem The validity of cross-validation for model comparison is questioned when models are relatively unstable.
method The study proves that simple, individually stable models can generate relatively unstable comparisons, invalidating CV inference.
result The Lasso and soft-thresholding generate relatively unstable comparisons, invalidating CV inferences.

Paper compares Ricci flow volume changes and applies to Kähler-Ricci flow.

problem Volume comparison in Ricci flow and convergence of Kähler-Ricci flow.
method Derives a new relative volume comparison estimate and applies it to Kähler-Ricci flow.
result Generalizes Perelman's no local collapsing estimate and provides an analogue of Bishop-Gromov volume comparison for Ricci flow.

Paper improves volume comparisons and entropy estimates for integral Ricci curvature.

problem Volume comparisons and entropy estimates for integral Ricci curvature.
method Several volume comparisons and an estimate for volume entropy.
result Improved estimates for volume entropy and algebraic entropy.

An algorithm learns a kernel matrix from relative-distance constraints for semi-supervised clustering.

problem Learning metrics from relative-distance constraints to capture finer structures.
method Log determinant divergence for kernel matrix learning with relative-distance constraints.
result Kernels learned from relative-distance constraints yield better clusterings than existing methods.

Divergence estimators based on direct approximation of density-ratios without going through separate approximation of numerator and denominator densities have been successfully applied to machine learning tasks that involve distribution comparison such as outlier detection, transfer learning, and two-sample homogeneity…

2011-06-23abs ↗pdf ↗

We consider an infinitesimal version of the Bishop-Gromov relative volume comparison condition as generalized notion of Ricci curvature bounded below for Alexandrov spaces. We prove a Laplacian comparison theorem for Alexandrov spaces under the condition. As an application we prove a topological splitting theorem.

2007-09-06abs ↗pdf ↗

Sharp inequality for compactifying Poincaré-Einstein manifolds.

problem Proving a sharp relative comparison inequality for compactifying Poincaré-Einstein manifolds.
method Proved a sharp relative comparison inequality for type-I Escobar-Yamabe compactification.
result Confirms a conjecture by proving the sharp relative comparison inequality.

Proves volume comparison and monotonicity for Bakry-Émery Ricci curvature.

problem Volume comparison and monotonicity for Bakry-Émery Ricci curvature.
method Relative volume comparison theorem for LPL^P-bound of Bakry-Émery Ricci curvature and gradient of potential function.
result Modified proof for volume comparison and monotonicity of Kähler-Ricci flow.

Study compares six feature sets and three baselines for time-series classification.

problem Comparing feature sets for time-series classification tasks.
method Normalization-based approach to benchmarking, comparing 124 problems.
result Feature sets perform similarly overall, with tsfresh showing strongest performance.

On Kahler manifolds with Ricci curvature lower bound, assuming the real analyticity of the metric, we establish a sharp relative volume comparison theorem for small balls. The model spaces being compared to are complex space forms, i.e, Kahler manifolds with constant holomorphic sectional curvature. Moreover, we give a…

2011-08-22abs ↗pdf ↗

The study compares and characterizes different notions of relative combinatorial asphericity.

problem Proving the asphericity of injective labeled oriented trees encoding spines of ribbon 2-knots.
method Overview and comparison of different notions of relative combinatorial asphericity, new characterizations, and tests.
result New tests that imply relative combinatorial asphericity and examples illustrating the concepts.

Meta-learning improves relative density-ratio estimation from limited data.

problem Estimating relative density-ratios from few instances.
method Meta-learning using neural networks to extract and embed dataset information for relative DRE.
result Meta-learning enables efficient and effective adaptation to few instances for relative DRE.

Paper compares feature selection methods using GCM and LOCO, showing GCM methods generally outperform LOCO.

problem Feature selection and importance estimation in model-agnostic settings.
method Comparison of feature selection methods related to GCM and LOCO under three model settings.
result GCM-related methods generally outperform LOCO under suitable regularity conditions, as shown by theoretical and empirical results.

Motivated by recent work of Choquet-Bruhat, Chrusciel, and Martin-Garcia, we prove monotonicity properties and comparison results for the area of slices of the null cone of a point in a Lorentzian manifold. We also prove volume comparison results for subsets of the null cone analogous to the Bishop-Gromov relative volu…

2010-08-03abs ↗pdf ↗

Study geometric and topological properties of Finsler manifolds with weighted Ricci curvature bounds.

problem Geometric and topological properties of Finsler metric measure manifolds with integral weighted Ricci curvature bounds.
method Establish Laplacian comparison theorem, volume comparison theorems, volume growth estimate, Gromov pre-compactness, local Dirichlet isoperimetric constant estimate.
result First Dirichlet eigenvalue estimate and gradient estimate for harmonic functions.

Given a compact Alexadrov nn-space ZZ with curvature curv κ\ge κ, and let f:ZXf: Z\to X be a distance non-increasing onto map to another Alexandrov nn-space with curv κ\ge κ. The relative volume rigidity conjecture says that if XX achieves the relative maximal volume i.e. vol(Z)=vol(X)vol(Z)=vol(X), then XX is isometric to $…

2011-06-23abs ↗pdf ↗

This paper examines the problem of ranking a collection of objects using pairwise comparisons (rankings of two objects). In general, the ranking of nn objects can be identified by standard sorting methods using nlog2nn log_2 n pairwise comparisons. We are interested in natural situations in which relationships among the o…

2011-09-16abs ↗pdf ↗

Paper proves a sharp weighted Isoperimetric inequality for substatic manifolds.

problem Proving geometric results for substatic Riemannian manifolds.
method Comparison theory based on a newly discovered conformal connection.
result Sharp, weighted Isoperimetric inequality quantifying boundary minimization.

It was proved by Mineyev and Yaman that, if (Γ,Γ)(Γ, Γ') is a relatively hyperbolic pair, the comparison map Hbk(Γ,Γ;V)Hk(Γ,Γ;V) H_b^k(Γ, Γ'; V) \to H^k(Γ, Γ'; V) is surjective for every k2k \ge 2, and any bounded ΓΓ--module VV. By exploiting results of Groves and Manning, we give another proof of this result. Moreover, we prove the …

2015-05-17abs ↗pdf ↗

New method targets relative risk heterogeneity in clinical trials.

problem Identifying treatment effects across subgroups with absolute risk differences.
method Modified causal forests using a novel node-splitting procedure based on relative risk.
result Relative risk causal forests can capture heterogeneity not detected by absolute risk methods.

A new framework evaluates HTE estimators using relative error.

problem Lack of robust evaluation methods for HTE estimators.
method Proposes a relative error-based evaluation framework and neural network architecture to estimate nuisance parameters and robustly compare HTE estimators.
result Demonstrates reliable comparisons and improved HTE estimation through the proposed framework and learning algorithm.

Under an infinitesimal version of the Bishop-Gromov relative volume comparison condition for a measure on an Alexandrov space, we prove a topological splitting theorem of Cheeger-Gromoll type. As a corollary, we prove an isometric splitting theorem for Riemannian manifolds with singularities of nonnegative (Bakry-Emery…

2009-03-30abs ↗pdf ↗

Paper tackles noisy comparison oracle for robust clustering algorithms.

problem Finding robust clustering algorithms under noisy comparison oracle.
method Develops algorithms for k-center clustering and agglomerative hierarchical clustering using noisy comparison oracle.
result Proves robust algorithms achieve good approximation guarantees with high probability.

We give a survey of various rigidity results involving scalar curvature. Many of these results are inspired by the positive mass theorem in general relativity. In particular, we discuss the recent solution of Min-Oo's Conjecture for the hemisphere (cf. [13]). We also analyze the case of equality in Bray's volume compar…

2010-08-18abs ↗pdf ↗

On Kahler manifolds with Ricci curvature bounded from below, we establish some theorems which are counterparts of some classical theorems in Riemannian geometry, for example, Bishop-Gromov's relative volume comparison, Bonnet-Meyers theorem, and Yau's gradient estimate for positive harmonic functions. The tool is a Boc…

2011-08-22abs ↗pdf ↗

Unified estimate for complex Monge-Ampère equations on Kähler manifolds.

problem Estimating solutions to complex Monge-Ampère equations on Kähler manifolds.
method Unified approach using PDE methods and entropy bounds to construct comparison metrics.
result Improves previous results on modulus of continuity, stability, and W1,1W^{1,1}-estimates of Green's functions.

We study the KK-armed dueling bandit problem, a variation of the standard stochastic bandit problem where the feedback is limited to relative comparisons of a pair of arms. We introduce a tight asymptotic regret lower bound that is based on the information divergence. An algorithm that is inspired by the Deterministic…

2015-06-08abs ↗pdf ↗

Paper tackles ranking items with a semi-random comparison graph and a monotone adversary.

problem Ranking items based on pairwise comparisons from a semi-random comparison graph with a monotone adversary.
method Developed a weighted maximum likelihood estimator (MLE) and an SDP-based approach to reweight the semi-random graph.
result Achieves near-optimal sample complexity, up to a log^2(n) factor, for identifying the top-K preferred items.

The paper develops a method to estimate consumer preferences from observed rankings.

problem Estimating consumer preferences from partial ranking information.
method Interpreting observed rankings as pairwise comparisons, modeling latent utility, and correcting for selection bias.
result The method improves recommendation performance, especially for previously unconsumed products.

New model for pairwise comparisons without stochastic transitivity.

problem Suboptimal performance of models assuming stochastic transitivity in real-world scenarios.
method Proposes a general family of statistical models using a skew-symmetric matrix.
result Achieves minimax-rate optimality and adapts to data sparsity.

We study the top-KK ranking problem where the goal is to recover the set of top-KK ranked items out of a large collection of items based on partially revealed preferences. We consider an adversarial crowdsourced setting where there are two population sets, and pairwise comparison samples drawn from one of the populat…

2016-02-15abs ↗pdf ↗

Paper proposes using pairwise feature comparisons to infer modification costs for user recourse.

problem Learning and inferring user preferences for modifying features in black-box models.
method Bradley-Terry model for inferring feature-wise costs from non-exhaustive human comparison surveys.
result Non-exhaustive human surveys can efficiently learn feature costs, enabling recourse finding.

In this article a relation between curvature functionals for surfaces in the Euclidean space and area functionals in relative differential geometry will be given. Relative differential geometry can be described as the geometry of surfaces in the affine space, endowed with a distinguished "relative normal vector field" …

2009-12-20abs ↗pdf ↗

Bispectral OT improves dataset comparison by preserving intrinsic coherence.

problem Ignoring intrinsic coherence in dataset comparisons using pairwise geometric distances.
method Introduces Bispectral Optimal Transport, a symmetry-aware extension of discrete OT.
result Transport plans computed with Bispectral OT achieve greater class preservation accuracy.