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

Trend · papers per month

75150224299 · Jun 202019922001200920172026
48 results for differentiable ranking

Paper introduces differentiable sorting and ranking with O(nlogn)O(n \log n) time complexity.

problem Non-differentiability of sorting and ranking operations in machine learning.
method Differentiable proxies constructed as projections onto the permutahedron and reduction to isotonic optimization.
result First differentiable sorting and ranking operators with O(nlogn)O(n \log n) time and O(n)O(n) space complexity.

Differentiable sorting and rank normalization are incompatible, with specific conditions for admissibility.

problem Incompatibility between differentiable sorting and rank normalization.
method Formalized admissibility through monotone invariance, batch independence, and rank-space stability conditions.
result Different gap-sensitive and batchwise relaxations of rank normalization violate the conditions for admissibility.

Geometric families of low-rank covariances improve flexibility and tractability in high dimensions.

problem Interpolating and identifying covariance matrices in high dimensions with limited data.
method Differential geometric construction of low-rank covariance families, interpolation on manifolds, and distance minimization for identification.
result Differential geometric covariance families offer significant flexibility and computational tractability.

New method finds efficient low-rank neural networks during training.

problem High memory and computational demands of neural networks.
method Restricts weight matrices to a low-rank manifold and updates low-rank factors.
result Significantly reduced time and memory resources required for training and evaluation.

Paper develops DP methods for low-rank matrix estimation with near-optimal performance.

problem Estimating a low-rank matrix under differential privacy constraints.
method Introduced computationally efficient DP-initialization and Riemannian optimization-based DP-RGrad algorithm.
result DP-RGrad achieves near-optimal convergence rate under weak differential privacy constraints.

Rank-based metrics are some of the most widely used criteria for performance evaluation of computer vision models. Despite years of effort, direct optimization for these metrics remains a challenge due to their non-differentiable and non-decomposable nature. We present an efficient, theoretically sound, and general met…

2019-12-07abs ↗pdf ↗

CoLoRA models predict PDE solutions quickly and accurately with minimal data.

problem Efficiently modeling PDE solutions with limited data.
method Continuous low-rank adaptation of neural networks trained on offline data.
result Predictions are orders of magnitude faster and more accurate than classical methods.

This paper improves entropy bounds for ranking time-series complexity.

problem Ranking the complexity of time series processes.
method Building on information theoretic bounds, the paper improves the upper bound of conditional differential entropy using Hadamard's inequality and covariance matrix properties.
result The improved bounds can be used to rank the complexity of time series processes.

Study the distribution for low-rank matrix learning, improving inference methods.

problem Lack of understanding of underlying probability distributions in low-rank matrix learning.
method Analyze the distribution f(X)eλXf(X)\propto e^{-λ\Vert X\Vert_*}, using differential geometry to design an improved MCMC algorithm and learn penalty parameter λ.
result Improved MCMC algorithm and penalty parameter learning for low-rank Bayesian inference.

Several tasks in machine learning are evaluated using non-differentiable metrics such as mean average precision or Spearman correlation. However, their non-differentiability prevents from using them as objective functions in a learning framework. Surrogate and relaxation methods exist but tend to be specific to a given…

2019-04-08abs ↗pdf ↗

Researchers classify differential operators between 3-sphere and 2-sphere bundles.

problem Classifying differential symmetry breaking operators between 3-sphere and 2-sphere bundles.
method Constructing and classifying all differential symmetry breaking operators D_{λ,ν}^m.
result Necessary and sufficient conditions for the existence of these operators.

PILNO uses neural operators to solve PDEs efficiently on point clouds.

problem Solving partial differential equations (PDEs) on point cloud data efficiently.
method Physics-informed low-rank neural operator framework combining low-rank kernel approximations and an encoder-decoder architecture.
result PILNO efficiently approximates solution operators of PDEs on point cloud data, satisfying PDE constraints and boundary conditions.

LR-EDNN reduces PDE solver complexity by limiting network weights to low-rank subspace.

problem Efficiently solving time-dependent PDEs with deep neural networks.
method Low-rank constraint on network weights using SVD for efficient parameter updates.
result LR-EDNN achieves comparable accuracy to full EDNN with fewer parameters and lower cost.

Efficiently samples complex distributions using tensor train format.

problem Sampling from high-dimensional complex probability densities efficiently.
method Integrates tensor train format with backward stochastic differential equations (BSDEs) for fast, robust, and accurate sampling.
result Improved efficiency in sampling from challenging target distributions.

Study differential operators and their solutions on manifolds, proving upper bounds and curvature.

problem Understanding the dimension of solution spaces for differential equations on manifolds.
method Analyzing ordinary and calibrated differential operators, constructing vector bundles and connections.
result Upper bounds and curvature obstructions for solution spaces, proving concentration theorems.

Link prediction (LP) algorithms propose to each node a ranked list of nodes that are currently non-neighbors, as the most likely candidates for future linkage. Owing to increasing concerns about privacy, users (nodes) may prefer to keep some of their connections protected or private. Motivated by this observation, our …

2019-07-20abs ↗pdf ↗

The study characterizes wobbly rank-2 bundles on Riemann surfaces using spectral curves.

problem Characterizing wobbly rank-2 bundles on Riemann surfaces.
method Using spectral curves and direct images of line bundles, the study provides sufficient and necessary conditions for wobbly bundles.
result All rank-2 wobbly bundles can be characterized as twists of direct images of line bundles.

A JAX toolbox solves optimal transport problems for point clouds and histograms.

problem Optimal transport problems between point clouds and histograms.
method Automatic and custom reverse mode differentiation, vectorization, just-in-time compilation, and accelerators support.
result Solves a wide range of optimal transport problems including regularized OT, barycenters, Gromov-Wasserstein, and low-rank solvers.

The paper mostly collects material on generic rank of AA--modules with respect to differential geometric applications. Our research was motivated by geometry of AA--structures. In particular, we discuss the case where AA is an unitary associative algebra not necessary with inversion. Some of the examples are studied…

2012-06-18abs ↗pdf ↗

The paper solves a 25-year-old problem about maximal growth distributions on manifolds.

problem Existence and classification of maximal growth distributions on smooth manifolds.
method Higher order convex integration and new criteria for ampleness of differential relations.
result Positive answer to the open question about parallelizable manifolds admitting maximal growth distributions.

DP-GD achieves dimension-independent convergence for unconstrained private GLMs.

problem Differentially private empirical risk minimization for unconstrained GLMs.
method Differentially private gradient descent (DP-GD).
result DP-GD achieves an excess empirical risk of $ ilde O\left(\sqrt{ exttt{rank}}/εn ight)$ for unconstrained GLMs.

We consider a problem of equivalence of generic pairs (X,V)(X,V) on a manifold MM, where VV is a distribution of rank mm and XX is a distribution of rank one. We construct a canonical bundle with a canonical frame. We prove that two pairs are equivalent if and only if the corresponding frames are diffeomorphic. As a p…

2007-12-10abs ↗pdf ↗

We extend the validity of a Gromov's dimension comparison estimate for topological hypersurfaces to sufficiently large classes of rectifiable sets, arising from Sobolev mappings. Our tools are a suitably weak exterior differentiation for pullback differential forms and a new low rank property for Sobolev mappings.

2015-07-27abs ↗pdf ↗

Paper extends multivariate rank tests for robust subspace detection.

problem Testing distributional similarity in multivariate data.
method Soft and subspace robust multivariate rank tests based on entropy regularized optimal transport.
result Trade-off between detection power and false alarm rate via projections.

Listwise learning-to-rank methods form a powerful class of ranking algorithms that are widely adopted in applications such as information retrieval. These algorithms learn to rank a set of items by optimizing a loss that is a function of the entire set -- as a surrogate to a typically non-differentiable ranking metric.…

2019-11-22abs ↗pdf ↗

Geometric structures on surfaces relate to 2-plane distributions in 5D.

problem Understanding geometric properties of vector bundles and distributions.
method Study of horizontal 2-plane distributions on 5-manifolds.
result Established a connection between surface projective differential geometry and 2-plane distribution growth.

It is established that the existence of non-isotropic vector field which Jacobi operator of maximal rank is an obstacle for the existence of non-trivial second-order symmetric parallel tensor field. In turns out that presence of such obstacle follows that manifold as pseudo-Riemannian manifold is locally non-reducible.…

2018-06-14abs ↗pdf ↗

We give various results and applications using the connection (E,)(E,\nabla) associated with a dd-web. Precisely, we exhibit fundamental invariants of the web related to the differential equation of first order which presents the web. They cast some new lights on the connection and its construction, both conceptually an…

2007-02-12abs ↗pdf ↗

New method differentiates square-root Kalman filters robustly.

problem Gradient calculation issues in square-root Kalman filters.
method Closed-form chain rule derived from Gramian identity, resolves non-orthogonal and rank-deficient issues.
result Robust automatic differentiation for Kalman filters, resolving numerical stability and gradient issues.

Improved GoF statistics using entropy-regularized optimal transport for multivariate rank.

problem Developing efficient multivariate rank statistics for statistical testing and generative modeling.
method Entropy-regularized optimal transport maps to address computational and sample complexity issues.
result Proposed soft rank energy and maximum mean discrepancy achieve fast convergence rates and are differentiable.

High resolution magnetic resonance (MR) images are desired for accurate diagnostics. In practice, image resolution is restricted by factors like hardware, cost and processing constraints. Recently, deep learning methods have been shown to produce compelling state of the art results for image super-resolution. Paying pa…

2018-09-10abs ↗pdf ↗

Study on harmonic metrics for rank 3 Higgs bundles in Hitchin section.

problem Finding compatible harmonic metrics for rank 3 Higgs bundles in the Hitchin section.
method Defined a symmetric pairing and studied spectral curves as 2-sheeted branched coverings.
result Gave a condition for Higgs bundles on C\mathbb{C} or C\mathbb{C}^* to have compatible harmonic metrics.