Proves conditions for Fourier transforms in rank 1 symmetric spaces.
problem Understanding Fourier transform bounds in symmetric spaces.
method Proves sufficient and necessary conditions using Lipschitz and Fourier type integral conditions.
result Establishes bounds for Fourier transforms in rank 1 symmetric spaces with specific moduli of continuity.
Constructs rank-based continuous semimartingales for financial markets.
problem Model financial markets using rank-based diffusions.
method Uses Dirichlet forms and Feller property to construct semimartingales.
result Establishes nonexistence of triple collisions and simplified rank process dynamics.
Replicated and validated Rank-N-Contrast for robust regression.
problem Deep regression models struggle with continuous sample orders.
method Contrastive learning of continuous representations by ranking samples.
result Improved performance and robustness of RNC framework.
A new method for Gaussian Processes handles mixed continuous and categorical inputs.
problem Modeling cross-correlations between continuous and categorical data.
method Low-Rank Correlation (LRC) method for Gaussian Processes with flexible rank approximation.
result LRC outperforms existing methods in estimating cross-correlations and predicting response surfaces.
The paper tackles continuous ranking problems with real-valued labels.
problem Continuous ranking with real-valued labels.
method Formulated as optimization of IROC curve or maximization of Kendall τ.
result Proposed a recursive statistical learning algorithm for empirical IROC curve optimization.
In binary classification and regression problems, it is well understood that Lipschitz continuity and smoothness of the loss function play key roles in governing generalization error bounds for empirical risk minimization algorithms. In this paper, we show how these two properties affect generalization error bounds in …
New method extends low-rank MDPs to continuous action spaces.
problem Limited applicability of current low-rank MDP methods to continuous action spaces.
method Extending FLAMBE algorithm to continuous action spaces with Hölder smoothness conditions.
result Similar PAC bound achieved for continuous actions with polynomial dependence on smoothness order.
In a recent work \cite{BG}, given a collection of continuous semimartingales, authors derive a semimartingale decomposition from the corresponding ranked processes in the case that the ranked processes can meet more than two original processes at the same time. This has led to a more general decomposition of ranked pro…
New algorithm for active bipartite ranking with continuous distributions.
problem Active ranking of bipartite data with continuous conditional distributions.
method Developed a novel algorithm called smooth-rank to minimize the distance between estimated and optimal ROC curves.
result Smooth-rank algorithm is PAC-(ε,δ) and outperforms existing methods in empirical tests. 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.
New method improves robust low-rank matrix completion for computer vision.
problem Robust low-rank matrix completion for partially observed data.
method Formulated as a nonsmooth Riemannian optimization problem over Grassmann manifold, solved with an alternating manifold proximal gradient continuation method.
result Demonstrated advantages over existing approaches in background extraction from surveillance videos.
Study shows risk-averse investors have consistent ranking of risky assets.
problem Ranking of risky assets in short-term investments.
method Analyzes various decision problems regarding risky assets with continuous returns.
result Risk-averse decision makers have the same ranking over risky assets.
Investment strategies for rank-dependent utility agents are derived in a continuous-time market.
problem Time inconsistency in rank-dependent utility models.
method Study of consistent planners seeking intra-personal equilibrium strategies.
result Explicit final wealth profile replicating equilibrium strategies, with scaling function derived.
Improves CRRR for better mobility analysis with DCTM.
problem Unclear interpretation of RRRX parameters.
method Uses DCTM for conditional ranks, cross-fitting, and asymptotic theory.
result Clearer interpretation and improved accuracy in mobility analysis.
Suppose that X1,…,Xn are continuous semimartingales that are reversible and have nondegenerate crossings. Then the corresponding rank processes can be represented by generalized Stratonovich integrals, and this representation can be used to decompose the relative log-return of portfolios generated by functi…
The paper tackles fair ranking in ranked data by addressing causal discrimination.
problem Fairness in predictive models for ranked data.
method Mapping rank positions to continuous scores, building causal graphs, and using path-specific effects.
result Effective algorithms for discovering and removing discrimination from ranked datasets.
Paper uses optimal transport-based statistics for change point detection.
problem Change point detection in multivariate data.
method Soft rank energy and entropically regularized optimal transport.
result Soft rank energy performs better in real datasets with strong continuity and convergence properties.
Kendall transformation converts continuous data into categorical vectors for robust information theory.
problem Handling small number of observations and preserving ranking in continuous data.
method Kendall transformation converts ordered features into categorical vectors of pairwise order relations.
result Kendall transformation makes information theory methods applicable to continuous data robustly.
Survey of structured low-rank algorithms for MR signal recovery.
problem Recovering multidimensional signals from few non-uniform measurements.
method Structured low-rank matrix completion formulation.
result Performance guarantees and fast algorithms for large-scale MR problems.
The study examines continuous mean curvature functions on manifolds without conjugate points.
problem Understanding properties of manifolds with specific curvature functions.
method Analyzing simply connected Riemannian manifolds with continuous horospherical mean curvature functions.
result Compact rank one manifolds without conjugate points are locally symmetric spaces of negative curvature.
Study of geodesic branching in 2D sub-Riemannian manifolds.
problem Branching of geodesics in sub-Riemannian manifolds of rank two.
method Analysis of geodesic behavior in sub-Riemannian geometry.
result Continuous families of strictly abnormal branching geodesics and accumulation of branching points.
Study continuity of limit sets in symmetric spaces.
problem Continuity of limit sets for geometrically finite subgroups in symmetric spaces.
method Extended geometrically finite representations theory.
result Limit sets vary continuously with respect to Hausdorff distance under strong convergence.
Solves low-rank approximation problems in Hilbert spaces.
problem Low-rank approximation in Hilbert spaces.
method Closed-form solutions and error bounds for bounded linear operators.
result Generalization to bounded linear operators from finite dimensions.
Paper develops compact formulations for optimization problems with rank-one convex functions and indicator variables.
problem Optimization problems involving rank-one convex functions with support constraints.
method Perspective reformulation techniques to exploit conic structure and establish convex hull results.
result Systematic perspective formulations for convex hull descriptions of sets with nonlinear separable or non-separable objective functions and combinatorial constraints.
Hashing, or learning binary embeddings of data, is frequently used in nearest neighbor retrieval. In this paper, we develop learning to rank formulations for hashing, aimed at directly optimizing ranking-based evaluation metrics such as Average Precision (AP) and Normalized Discounted Cumulative Gain (NDCG). We first o…
Pairwise fairness for ranking and regression models.
problem Ensuring fairness in ranking and regression models with protected groups and attributes.
method Developed pairwise fairness metrics for ranking and regression, using constrained optimization and robust optimization techniques.
result Efficient and effective solutions for training problems, demonstrated through experiments.
A federated model learns shared archetypes from heterogeneous clients in continual learning.
problem Federated learning struggles with client heterogeneity and streaming distribution shifts.
method Clients encode their data as low-rank Hebbian operators, which are sent to a central server for aggregation and factorization into global archetypes.
result Improved global archetype reconstruction and associative retrieval in heterogeneous clients, drift, and novelty settings.
An Atlas model is a rank-based system of continuous semimartingales for which the steady-state values of the processes follow a power law, or Pareto distribution. For a power law, the log-log plot of these steady-state values versus rank is a straight line. Zipf's law is a power law for which the slope of this line is …
Study on positivity properties of vector bundle Monge-Ampère equation.
problem Analyzing positivity in vector bundle Monge-Ampère equation.
method Investigates MA-positivity and MA-semi-positive solutions for different ranks of holomorphic bundles over complex surfaces and manifolds.
result Positivity preservation in rank-two holomorphic bundles but not in higher ranks.
We construct new homogeneous Einstein spaces with negative Ricci curvature in two ways: First, we give a method for classifying and constructing a class of rank one Einstein solvmanifolds whose derived algebras are two-step nilpotent. As an application, we describe an explicit continuous family of ten-dimensional Einst…
Let (M,g) be a globally symmetric space of noncompact type, of arbitrary rank, and Δ its Laplacian. We prove the existence of a meromorphic continuation of the resolvent $(Δ-\ev)^{-1}$ across the continuous spectrum to a Riemann surface multiply covering the plane. The methods are purely analytic and are adapted fr…
In this paper we study perturbations of constant cocycles for actions of higher rank semi-simple algebraic groups and their lattices. Roughly speaking, for ergodic actions, Zimmer's cocycle superrigidity theorems implies that the perturbed cocycle is measurably conjugate to a constant cocycle modulo a compact valued co…
UA-LQE improves value function learning by selectively erasing uncertain entries in Q-matrix.
problem Improving value function learning in complex reinforcement learning tasks.
method Uncertainty-aware low-rank Q-matrix estimation (UA-LQE) algorithm.
result UA-LQE selectively erases uncertain entries in Q-matrix to improve value function approximation.
Paper evaluates CRPS for extreme event forecasts, finding it unsuitable.
problem Verifying probabilistic forecasts of extreme events is challenging.
method Formal framework using extreme value theory to assess CRPS as a random variable.
result CRPS is unsuitable for extreme event verification.
Local invertibility of higher rank tensor fields on curved manifolds proven.
problem Local invertibility of geodesic ray transform on tensor fields of rank four.
method Proved local invertibility up to potential fields on Riemannian manifolds with strictly convex boundary.
result Local invertibility of tensor fields of rank four on curved manifolds proven.
Paper optimizes combining expert predictions using CRPS loss.
problem Optimizing combining expert predictions in online learning.
method Combines probabilistic forecasts using CRPS loss function in the prediction with expert advice framework.
result Time-independent upper bound for the regret of the Vovk's aggregating algorithm using CRPS as a loss function is obtained.
Free groups' automorphisms have bounded orbits.
problem Understanding automorphisms of infinite rank free groups.
method Proved coarsely bounded automorphism groups via metric space actions.
result Free groups' automorphism groups have quasi-isometry type of a point.
New method prevents forgetting in LLMs by dynamically identifying task-specific subspaces.
problem Catastrophic forgetting in continual learning of LLMs.
method Adaptive Singular Value Decomposition (SVD) for constrained full fine-tuning.
result Achieves state-of-the-art results in continual learning benchmarks.
Physics-inspired methods optimize SVD compression of LLMs.
problem Efficiently compressing large language models (LLMs) using SVD.
method FermiGrad for globally optimal rank selection and PivGa for lossless compression.
result Global optimization of SVD ranks and lossless compression of low-rank factors.
Study on Finsler spaces with unique prime geodesics.
problem Estimating the number of orbits of prime closed geodesics in Finsler manifolds.
method Generalizing works on two prime closed geodesics to equivariant situation, studying homogeneous Finsler geometry.
result Closed Finsler manifold with only one orbit of prime closed geodesic is a compact rank-one Riemannian symmetric space when dimension is even or metric is reversible.
LoRA-MCL improves language models by generating diverse sentence continuations.
problem Language models struggle with generating diverse, plausible sentence continuations.
method Low-Rank Adaptation combined with Multiple Choice Learning (MCL) to handle ambiguity.
result LoRA-MCL generates high-diversity and relevant outputs in various tasks.
Study Brieskorn spheres using Floer homology, generating infinite rank summands in homology cobordism.
problem Computing Heegaard Floer homologies of Brieskorn spheres.
method Floer theoretic invariants of Dai, Hom, Stoffregen, and Truong.
result Brieskorn spheres generate infinite rank summands in the homology cobordism group.
The theory of geometric zeta functions for locally symmetric spaces as initialized by Selberg and continued by numerous mathematicians is generalized to the case of higher rank spaces. We show analytic continuation, describe the divisor in terms of tangential cohomology and in terms of group cohomology which generalize…
LITE models improve query-document relevance with learnable late interactions.
problem Improving query-document relevance with lower latency and storage.
method Proposes learnable late-interaction models (LITE) that use factorized query and document embeddings followed by a learnable scorer.
result Empirically, LITE outperforms previous late-interaction models in re-ranking tasks.
Identifies interpretable generative model for multivariate data.
problem Black-box architectures of deep generative models are often unidentified and difficult to interpret.
method Introduces Deep Discrete Encoder (DDE) Copula, a hierarchical binary latent variable model inside a copula framework.
result Establishes conditions for identification of DDE copula parameters and proves posterior consistency.
Paper discusses extending Gini score for tied rankings and case weights.
problem Extending Gini score for tied rankings and case weights.
method Discuss and adapt Gini score for ties and case weights.
result Gini score can be used for tied rankings and case weights.
Bayesian method combines expert and user rankings using copulas.
problem Combining expert and user rankings for accurate predictions.
method Bayesian inference with copula modeling latent variables.
result Predictive distribution of user rankings can be approximated accurately.
Estimates transaction arrival patterns in intraday electricity markets.
problem Estimating transaction arrival processes in intraday electricity markets.
method Model inter-arrivals using multiple time-varying parametric densities based on the generalized F distribution.
result Significant insights into model fit and prediction accuracy evaluated by various metrics.