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.
Study on pairwise counter-monotonicity, a type of negative dependence.
The paper analyzes cryptocurrency trading networks using pairwise and high-order dependencies.
We study the dependence structure of market states by estimating empirical pairwise copulas of daily stock returns. We consider both original returns, which exhibit time-varying trends and volatilities, as well as locally normalized ones, where the non-stationarity has been removed. The empirical pairwise copula for ea…
Proposes a novel tensor-based approach for multi-level link prediction.
RL-LOW algorithm achieves exponential simple regret in offline RLHF with pairwise comparisons.
The functions of proteins and RNAs are determined by a myriad of interactions between their constituent residues, but most quantitative models of how molecular phenotype depends on genotype must approximate this by simple additive effects. While recent models have relaxed this constraint to also account for pairwise in…
Pairwise learning usually refers to a learning task which involves a loss function depending on pairs of examples, among which most notable ones include ranking, metric learning and AUC maximization. In this paper, we study an online algorithm for pairwise learning with a least-square loss function in an unconstrained …
Bayesian VI copula models capture asymmetric intraday equity dependence.
In this study, we analyzed the activity of monkey V1 neurons responding to grating stimuli of different orientations using inference methods for a time-dependent Ising model. The method provides optimal estimation of time-dependent neural interactions with credible intervals according to the sequential Bayes estimation…
In this paper we study the stability and its trade-off with optimization error for stochastic gradient descent (SGD) algorithms in the pairwise learning setting. Pairwise learning refers to a learning task which involves a loss function depending on pairs of instances among which notable examples are bipartite ranking,…
Study on deep neural networks for reward modeling with pairwise comparison data.
A new method detects and displays pairwise dependence between variates.
Paper characterizes and represents pairwise causal background knowledge for improved causal inference.
Data in the form of pairwise comparisons arises in many domains, including preference elicitation, sporting competitions, and peer grading among others. We consider parametric ordinal models for such pairwise comparison data involving a latent vector that represents the "qualities" of the ite…
Rank aggregation systems collect ordinal preferences from individuals to produce a global ranking that represents the social preference. Rank-breaking is a common practice to reduce the computational complexity of learning the global ranking. The individual preferences are broken into pairwise comparisons and applied t…
Dynamic Vine Copulas detect and quantify time-varying higher-order interactions in multivariate systems.
We present a novel k-way high-dimensional graphical model called the Generalized Root Model (GRM) that explicitly models dependencies between variable sets of size k > 2---where k = 2 is the standard pairwise graphical model. This model is based on taking the k-th root of the original sufficient statistics of any univa…
Develops a new causal model for path-dependent link prediction.
Automated tests detect interactions in unstructured data.
Efficient online learning with pairwise loss functions is a crucial component in building large-scale learning system that maximizes the area under the Receiver Operator Characteristic (ROC) curve. In this paper we investigate the generalization performance of online learning algorithms with pairwise loss functions. We…
Several classification methods assume that the underlying distributions follow tree-structured graphical models. Indeed, trees capture statistical dependencies between pairs of variables, which may be crucial to attain low classification errors. The resulting classifier is linear in the log-transformed univariate and b…
Bayesian model infers strengths from noisy tennis match outcomes.
New method identifies key channels for extreme brain events.
In this paper, we study the generalization properties of online learning based stochastic methods for supervised learning problems where the loss function is dependent on more than one training sample (e.g., metric learning, ranking). We present a generic decoupling technique that enables us to provide Rademacher compl…
Three supervised learning methods for selecting logratios in compositional data analysis.
New algorithm learns permutations mixtures with optimal sample complexity.
Models can be simple for different reasons: because they yield a simple and computationally efficient interpretation of a generic dataset (e.g. in terms of pairwise dependences) - as in statistical learning - or because they capture the essential ingredients of a specific phenomenon - as e.g. in physics - leading to no…
We propose a methodology to explore and measure the pairwise correlations that exist between variables in a dataset. The methodology leverages copulas for encoding dependence between two variables, state-of-the-art optimal transport for providing a relevant geometry to the copulas, and clustering for summarizing the ma…
Introduces a probabilistic framework for dimension reduction methods.
Unified framework for binary responses using AUC loss and low-rank constraint.
Paper introduces MSA for weakly supervised covariance alignment in MEG signals.
Deep model learns protein interfaces from high-order interactions.
We propose three measures of mutual dependence between multiple random vectors. All the measures are zero if and only if the random vectors are mutually independent. The first measure generalizes distance covariance from pairwise dependence to mutual dependence, while the other two measures are sums of squared distance…
AutoEmbedder clusters unlabeled data using semi-supervised DNN embedding.
New algorithm ranks players from partial comparisons with optimal rate.
The classification of shapes is of great interest in diverse areas ranging from medical imaging to computer vision and beyond. While many statistical frameworks have been developed for the classification problem, most are strongly tied to early formulations of the problem - with an object to be classified described as …
We introduce a novel kernel that models input-dependent couplings across multiple latent processes. The pairwise joint kernel measures covariance along inputs and across different latent signals in a mutually-dependent fashion. A latent correlation Gaussian process (LCGP) model combines these non-stationary latent comp…
We study the problem of ranking from crowdsourced pairwise comparisons. Answers to pairwise tasks are known to be affected by the position of items on the screen, however, previous models for aggregation of pairwise comparisons do not focus on modeling such kind of biases. We introduce a new aggregation model factorBT …
LOT Wassmap speeds up Wasserstein space manifold learning.
Algorithm aggregates rewards from multiple players to learn related tasks in online bandit learning.
Paper calculates KL divergence for isotropic Gaussian-Markov fields.
In this study, a pairwise comparison matrix is generalized to the case when coefficients create Lie group , non necessarily abelian. A necessary and sufficient criterion for pairwise comparisons matrices to be consistent is provided. Basic criteria for finding a nearest consistent pairwise comparisons matrix (extend…
Paper introduces differential pairwise privacy for secure metric learning.
Clustering using neural networks has recently demonstrated promising performance in machine learning and computer vision applications. However, the performance of current approaches is limited either by unsupervised learning or their dependence on large set of labeled data samples. In this paper, we propose ClusterNet …
Best-of-N sampling reveals reward targets from preference data, influencing N and base distribution choices.
Cross-entropy loss linked to metric learning, outperforming complex pairwise losses.
Develops a statistical framework to measure uncertainty in model rankings based on human preferences.
We consider the problem of estimating a ranking on a set of items from noisy pairwise comparisons given item features. We address the fact that pairwise comparison data often reflects irrational choice, e.g. intransitivity. Our key observation is that two items compared in isolation from other items may be compared bas…