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

Trend · papers per month

103207310413 · Jun 202019922001200920172026
48 results for Continuous similarity

Introduces CHL, a new loss function for continuous similarity learning.

problem Binary similarity learning limitations.
method CHL is a novel loss function that generalizes histogram loss to continuous similarities.
result CHL solves a wider range of tasks including similarity learning, representation learning, and data visualization.

Study shows how task similarity affects forgetting in teacher-student setup.

problem Catastrophic forgetting in continual learning.
method Extended teacher-student setup to multiple teachers, analyzing similarity between tasks.
result Task similarity, whether at readouts or features, influences forgetting and transfer.

CAM-GAN improves GANs for continual learning with efficient feature map transformations.

problem Efficient continual learning for GANs with reduced parameter growth.
method Designing and leveraging parameter-efficient feature map transformations, including global and task-specific parameters, residual bias, and Fisher information matrix.
result Significantly improved model performance and high-quality samples with fewer parameters.

Improved similarity search in embeddings using InfoNCE loss.

problem Improving similarity search in embedding models trained by contrastive learning.
method Introduced a new continuity bound for InfoNCE loss via Gâteaux differentiation, preserving the averaging effect of negative samples.
result Demonstrated that the averaging effect of kk negative samples in InfoNCE loss carries over to stabilisation of generalisation error as kk grows.

Study on curvature blow-up and convergence of continuity method on Hirzebruch surface.

problem Curvature blow-up and convergence of continuity method on Hirzebruch surface.
method Continuity method applied to generalised Hirzebruch surface, focusing on Gromov-Hausdorff convergence and scalar curvature estimates.
result A general solution to the continuity method either exists or all times, or the scalar curvature blows up.

In 1997, J. Jost [27] and F. H. Lin [39], independently proved that every energy minimizing harmonic map from an Alexandrov space with curvature bounded from below to an Alexandrov space with non-positive curvature is locally Hölder continuous. In [39], F. H. Lin proposed a challenge problem: Can the Hölder continuity …

2013-11-06abs ↗pdf ↗

We propose a family of near-metrics based on local graph diffusion to capture similarity for a wide class of data sets. These quasi-metametrics, as their names suggest, dispense with one or two standard axioms of metric spaces, specifically distinguishability and symmetry, so that similarity between data points of arbi…

2017-07-21abs ↗pdf ↗

Study analyzes catastrophic forgetting in continual learning using teacher-student networks.

problem Catastrophic forgetting in continuously learning systems.
method Teacher-student learning framework, similarity of input distributions and target functions.
result Network can avoid catastrophic forgetting with small input distribution similarity and large target function similarity.

Continuous epimorphisms between certain mapping class groups are induced by homeomorphisms.

problem Understanding continuous epimorphisms between specific mapping class groups.
method Analyzing subgroups of mapping class groups of infinite-genus 2-manifolds with no planar ends.
result Continuous epimorphisms are induced by homeomorphisms for the specified subgroups.

We present the Variational Adaptive Newton (VAN) method which is a black-box optimization method especially suitable for explorative-learning tasks such as active learning and reinforcement learning. Similar to Bayesian methods, VAN estimates a distribution that can be used for exploration, but requires computations th…

2017-11-15abs ↗pdf ↗

The study explores homeomorphism groups of self-similar 2-manifolds, including the 2-sphere and Cantor set.

problem Understanding the structure and properties of homeomorphism groups of self-similar 2-manifolds.
method Survey of recent results, exposition of classical results, treatment of stable sets, and proof of new theorems.
result Characterization of homeomorphisms of perfectly self-similar 2-manifolds and extensions of existing results.

PEAKS selects key training examples incrementally based on prediction error and kernel similarity.

problem Dynamic data selection in deep learning models.
method Prediction Error Anchored by Kernel Similarity (PEAKS) for incremental data selection.
result PEAKS outperforms existing selection strategies and yields better performance returns as training data size grows.

Efficient method for learning continuous exponential families beyond Gaussian.

problem Learning continuous exponential families with unbounded support.
method Interaction Screening approach for scalable learning of continuous graphical models.
result Our estimator maintains similar accuracy and sample complexity scalings compared to alternative approaches, while improving run-time.

OGD proves robustness to Catastrophic Forgetting in Continual Learning.

problem Catastrophic Forgetting in Continual Learning with deep neural networks.
method Theoretical framework based on Neural Tangent Kernel for OGD.
result First generalization bound for SGD and OGD in Continual Learning.

SX-GeoTree improves spatially coherent explanations in geospatial regression trees.

problem Capturing spatial dependence and producing robust explanations in tabular prediction models.
method Integrates three objectives: impurity reduction, spatial residual control, and explanation robustness via modularity maximization on a consensus similarity network.
result Improves residual spatial evenness and doubles attribution consensus (modularity: Fujian 0.19 vs 0.09; Seattle 0.10 vs 0.05).

Solves complex Monge-Ampère equations with Hölder continuous solutions in Kähler manifolds.

problem Finding Hölder continuous solutions to complex Monge-Ampère equations.
method Analyzes the complex Monge-Ampère equation in Kähler manifolds using Sobolev spaces and Hölder continuity.
result Hölder continuity of solutions is equivalent to the measure's Hölder continuity in a complex Sobolev space.

Study on neural networks' performance in sequential task learning.

problem Understanding the performance of neural networks in sequential task learning.
method Theoretical analysis of generalization performance in continual learning using statistical mechanical analysis of kernel ridge-less regression.
result Characteristic transitions from positive to negative transfer observed in neural networks.

Continuized Nesterov acceleration accelerates stochastic gradient descent and gossip algorithms.

problem Improving the convergence rate of stochastic gradient descent and gossip algorithms.
method Introducing a continuized variant of Nesterov acceleration, which mixes variables continuously and takes gradient steps at random times.
result The continuized Nesterov acceleration achieves convergence rates similar to Nesterov's original acceleration but with random parameters.

New similarity measure for covariate shift improves nonparametric regression rates.

problem Improving nonparametric regression under covariate shift.
method Introducing a new similarity measure based on probability ratios.
result Shows a sharper rate of convergence compared to transfer exponent.

Excessive reuse of test data has become commonplace in today's machine learning workflows. Popular benchmarks, competitions, industrial scale tuning, among other applications, all involve test data reuse beyond guidance by statistical confidence bounds. Nonetheless, recent replication studies give evidence that popular…

2019-05-29abs ↗pdf ↗

Study on self-similar surfaces and their mapping class groups generated by involutions.

problem When do big mapping class groups of self-similar surfaces generated by involutions?
method Investigation of self-similar surfaces with self-similar ends, focusing on infinite and one maximal ends.
result For self-similar surfaces with infinite maximal ends, their mapping class groups are generated by involutions and are uniformly perfect.

Continuous time random walks impose a random waiting time before each particle jump. Scaling limits of heavy tailed continuous time random walks are governed by fractional evolution equations. Space-fractional derivatives describe heavy tailed jumps, and the time-fractional version codes heavy tailed waiting times. Thi…

2008-09-09abs ↗pdf ↗

Unified understanding of three continual learning regularisation methods.

problem Maintaining knowledge of earlier tasks without re-accessing them.
method Three regularisation approaches: Elastic Weight Consolidation (EWC), Synaptic Intelligence (SI), and Memory Aware Synapses (MAS).
result EWC, SI, and MAS are linked to the same theoretical quantity, the square root of the Fisher Information.

New method uses dynamic programming for meta continual learning.

problem Challenges of generalization and catastrophic forgetting in sequential learning.
method Developed a theoretical framework using dynamic programming for meta continual learning.
result Theoretical and practical method achieves better accuracy than existing methods.

Logarithmic regret achieved in continuous-time linear-quadratic reinforcement learning.

problem Optimizing control actions in unknown continuous-time systems over a finite time horizon.
method Least-squares algorithm based on continuous-time observations and controls, with perturbation analysis and parameter estimation error analysis.
result Logarithmic regret bound of order O((lnM)(lnlnM))O((\ln M)(\ln\ln M)).

Distributed representations of sentences have become ubiquitous in natural language processing tasks. In this paper, we consider a continual learning scenario for sentence representations: Given a sequence of corpora, we aim to optimize the sentence encoder with respect to the new corpus while maintaining its accuracy …

2019-04-18abs ↗pdf ↗

New framework discovers non-affine continuous symmetries in neural networks.

problem Lack of efficient methods for detecting non-affine continuous symmetries in neural networks.
method Computational framework for discovering infinitesimal generators of multi-parameter group actions.
result Framework can discover non-affine continuous symmetries in neural networks.

Entangled bisimulation improves policy learning from visual input.

problem Learning generalizeable policies from visual input in the presence of visual distractions.
method Proposes entangled bisimulation, a bisimulation metric for continuous state and action spaces.
result Entangled bisimulation improves policy learning on the Distracting Control Suite (DCS).

Similarity graphs are an active research direction for the nearest neighbor search (NNS) problem. New algorithms for similarity graph construction are continuously being proposed and analyzed by both theoreticians and practitioners. However, existing construction algorithms are mostly based on heuristics and do not exp…

2019-11-27abs ↗pdf ↗

We define a new type of metric comparison similar to the comparison of Alexandrov. We show that it has strong connections to continuity of optimal transport between regular measures on a Riemannian manifold, in particular to the so called MTW condition introduced by Xi-Nan Ma, Neil Trudinger and Xu-Jia Wang.

2017-11-26abs ↗pdf ↗

A new method for continual learning in GANs learns new modes with limited data.

problem Learning new target modes with limited samples while preserving previously learned ones.
method Mode-affinity score for generative modeling, generator replay, and weighted label generation.
result Gains over state-of-the-art methods, even with fewer training samples.

In the field of Natural Language Processing (NLP), we revisit the well-known word embedding algorithm word2vec. Word embeddings identify words by vectors such that the words' distributional similarity is captured. Unexpectedly, besides semantic similarity even relational similarity has been shown to be captured in word…

2018-06-20abs ↗pdf ↗