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

Trend · papers per month

58115173230 · Jun 202019922001200920172026
48 results for contrastive questions

The paper shows how to answer future and past questions from high-dimensional time series data.

problem Challenges in answering probabilistic inference questions from high-dimensional time series data.
method Temporal contrastive learning to learn Gaussian representations that enable compact closed-form solutions.
result Representations learned via contrastive learning follow a Gauss-Markov chain, enabling efficient inference and planning.

This work shows that supervised contrastive learning achieves similar results to cross-entropy but requires more iterations.

problem The question of whether there are fundamental differences in representation geometry between supervised contrastive learning and cross-entropy.
method The authors prove that both losses attain their minimum when representations of each class collapse to the vertices of a regular simplex, and they empirically validate this finding.
result Supervised contrastive learning requires more iterations to reach a close-to-optimal state compared to cross-entropy, indicating different optimization behavior.

This work studies how contrastive learning extracts features from unlabeled data.

problem How neural networks trained by contrastive learning can extract features from unlabeled data.
method Formal analysis of contrastive learning's feature learning process, considering two types of features: sparse and dense.
result Contrastive learning using ReLU networks can learn sparse features if proper augmentations are adopted.

CCM improves context for Meta-RL by contrastive learning.

problem Improving context for Meta-RL to enable task generalization.
method CCM framework using contrastive learning for context encoding and information-gain-based trajectory collection.
result CCM outperforms state-of-the-art algorithms in benchmarks and sparse-reward environments.

LoCo learns local representations without end-to-end synchronization, improving performance on complex tasks.

problem Learning local representations without end-to-end synchronization constraints.
method Overlap local blocks to increase decoder depth and allow feedback from upper to lower layers.
result LoCo closes the performance gap between local learning and end-to-end contrastive learning.

COBRA reduces modality gap in cross-modal tasks.

problem Joint embedding spaces fail to sufficiently reduce modality gap in multi-modal tasks.
method COBRA trains image and text modalities in a joint fashion using Contrastive Predictive Coding and Noise Contrastive Estimation.
result COBRA significantly reduces the modality gap and generates robust joint-embedding space.

Study evaluates how well question-answering models generalize to new data types.

problem Generalization of question-answering models to new data types.
method Constructed new test sets from different domains and evaluated models' performance.
result Models show significant performance drops when tested on new data types.

Recent advances in interpretable Machine Learning (iML) and eXplainable AI (XAI) construct explanations based on the importance of features in classification tasks. However, in a high-dimensional feature space this approach may become unfeasible without restraining the set of important features. We propose to utilize t…

2018-06-19abs ↗pdf ↗

Self-supervised and supervised methods learn similar intermediate visual representations but diverge in final layers.

problem Comparing self-supervised and supervised methods for visual learning.
method Comparison of contrastive self-supervised and supervised methods on simple image data.
result Contrastive and supervised methods learn similar intermediate representations but diverge in final layers.

Fast approximate nearest neighbor (NN) search in large databases is becoming popular. Several powerful learning-based formulations have been proposed recently. However, not much attention has been paid to a more fundamental question: how difficult is (approximate) nearest neighbor search in a given data set? And which …

2012-06-27abs ↗pdf ↗

We prove that the canonical 4-dimensional surgery problems can be solved after passing to a double cover. This contrasts the long-standing conjecture about the validity of the topological surgery theorem for arbitrary fundamental groups (without passing to a cover). As a corollary, the surgery conjecture is reformulate…

2005-05-18abs ↗pdf ↗

The holy grail of deep learning is to come up with an automatic method to design optimal architectures for different applications. In other words, how can we effectively dimension and organize neurons along the network layers based on the computational resources, input size, and amount of training data? We outline prom…

2018-06-17abs ↗pdf ↗

The restricted planar three-body problem has a rich history, yet many unanswered questions still remain. In the present paper we prove the existence of a global surface of section near the smaller body in a new range of energies and mass ratios for which the Hill's region still has three connected components. The appro…

2011-03-20abs ↗pdf ↗

Develops transparent global models consistent with local explanations.

problem Creating globally interpretable models that align with local explanations from black-box models.
method Custom boolean features from sparse local contrastive explanations are used to train a globally transparent model.
result Custom transparent models have higher local consistency compared to other strategies.

GRACE generates concise explanations for neural networks on tabular data.

problem Lack of explainable AI solutions for neural networks on tabular data.
method Borrowing ideas from causality and philosophy, GRACE generates contrastive samples to explain neural network predictions.
result GRACE explanations are more intuitive and lead to better decision-making.

We study the topology of the 13 dimensional positively curved Bazaikin spaces. We show that there is only one such manifold which is homotopy equivalent to a homogeneous space, the so called Berger space. This is in contrast to the case of the 7 dimensional positively curved Eschenburg spaces. In addition, we compute t…

2006-04-12abs ↗pdf ↗

Given a graphical model, one essential problem is MAP inference, that is, finding the most likely configuration of states according to the model. Although this problem is NP-hard, large instances can be solved in practice. A major open question is to explain why this is true. We give a natural condition under which we …

2017-03-08abs ↗pdf ↗

Many parametric statistical models are not properly normalised and only specified up to an intractable partition function, which renders parameter estimation difficult. Examples of unnormalised models are Gibbs distributions, Markov random fields, and neural network models in unsupervised deep learning. In previous wor…

2018-06-10abs ↗pdf ↗

We give new counterexamples to a question of Karsten Grove, whether there are only finitely many rational homotopy types among simply connected manifolds satisfying the assumptions of Gromov's Betti number theorem. Our counterexamples are homogeneous Riemannian manifolds, in contrast to previous ones. They consist of t…

2014-11-07abs ↗pdf ↗

Let X be a smooth complex projective variety of dimension d. It is classical that ample line bundles on X satisfy many beautiful geometric, cohomological, and numerical properties that render their behavior particularly tractable. By contrast, examples due to Cutkosky and others have led to the common impression that t…

2005-05-03abs ↗pdf ↗

Deformation spaces Hom(ππ,G)/G of representations of the fundamental group ππ of a surface ΣΣ in a Lie group GG admit natural actions of the mapping class group ModΣMod_Σ, preserving a Poisson structure. When GG is compact, the actions are ergodic. In contrast if GG is noncompact semisimple, the associated deformat…

2005-09-06abs ↗pdf ↗

Pairs of genus 2 mutant knots can have different Homfly polynomials, for example some 3-string satellites of Conway mutant pairs. We give examples which have different Kauffman 3-variable polynomials, answering a question raised by Dunfield et al in their study of genus 2 mutants. While pairs of genus 2 mutant knots ha…

2007-08-03abs ↗pdf ↗

New study shows neural networks can generalize without gradient descent, especially in deep settings.

problem Whether neural networks need gradient descent for generalization.
method Theoretical study of matrix factorization with linear and non-linear activation, comparing gradient descent to Guess & Check.
result Generalization under Guess & Check deteriorates with increasing width but improves with depth, challenging conventional wisdom.

The paper tackles optimal level set estimation in crowdsourcing and tournaments.

problem Deciphering small entries in a partially observed matrix of expert correctness.
method Constructs an efficient polynomial-time algorithm for recovering level sets up to a precision.
result The algorithm is minimax optimal for the classification problem, contrasting with existing literature.

Study symplectification of rank 2 distributions and their connections.

problem Understanding symplectification and Cartan prolongations of rank 2 distributions.
method Using Tanaka-Morimoto theory and symplectification procedure for rank 2 distributions.
result Demonstrates the existence of normal Cartan connections and iterated prolongations for rank 2 distributions.

Crooked planes are piecewise linear surfaces that were introduced by Drumm in the early 1990s to construct fundamental domains for properly discontinuous actions of free groups on Minkowski 3-space. In a previous paper, we introduced analogues of these surfaces, called AdS crooked planes, in the 3-dimensional anti-de S…

2014-10-21abs ↗pdf ↗

We investigate a question of Cooper adjacent to the Virtual Haken Conjecture. Assuming certain conjectures in number theory, we show that there exist hyperbolic rational homology 3-spheres with arbitrarily large injectivity radius. These examples come from a tower of abelian covers of an explicit arithmetic 3-manifold.…

2005-08-16abs ↗pdf ↗

MTSCI uses diffusion models to impute multivariate time series data with consistency.

problem Imputation of missing values in multivariate time series data.
method MTSCI employs a contrastive complementary mask and mixup mechanism to ensure intra-consistency and inter-consistency.
result MTSCI achieves state-of-the-art performance on multivariate time series imputation tasks.

Given a finite set of European call option prices on a single underlying, we want to know when there is a market model which is consistent with these prices. In contrast to previous studies, we allow models where the underlying trades at a bid-ask spread. The main question then is how large (in terms of a deterministic…

2016-08-19abs ↗pdf ↗

A 3-manifold is Haken if it contains a topologically essential surface. The Virtual Haken Conjecture posits that every irreducible 3-manifold with infinite fundamental group has a finite cover which is Haken. In this paper, we study random 3-manifolds and their finite covers in an attempt to shed light on this difficul…

2005-02-27abs ↗pdf ↗

Proposes a method to measure similarity between anomaly scores from different methods.

problem Difficulty in directly comparing anomaly detection methods.
method A measure based on extremal similarity in scoring distributions using a novel upper quadrant modeling approach.
result Demonstrates the ability to detect clusters of anomaly detection algorithms and achieve an accurate ensemble algorithm.