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

Trend · papers per month

4079119158 · May 202619922001200920172026
48 results for Anchor Invariance

Consider an anchored bundle (E,ρ)(E,ρ), i.e. a vector bundle EME\to M equipped with a bundle map ρ ⁣:ETMρ\colon E \to TM covering the identity. M.~Kapranov showed in the context of Lie-Rinehard algebras that there exists an extension of this anchored bundle to an infinite rank universal free Lie algebroid FR(E)EFR(E)\supset E. We …

2019-04-11abs ↗pdf ↗

A new method improves label propagation for unsupervised domain adaptation.

problem Improving unsupervised domain adaptation through semi-supervised learning techniques.
method Label Propagation with Augmented Anchors (A2^2LP) for UDA.
result A2^2LP improves over representative UDA methods and benchmarks.

Adaptive anchor methods improve multi-modal learning by balancing intra-modal and inter-modal information.

problem Fixed anchor methods limit multi-modal learning by over-reliance on a single modality and inadequate cross-modal correlation.
method Adaptive anchor methods using centroid-based anchors from all modalities.
result Adaptive anchor methods like CentroBind consistently outperform fixed anchor methods across various datasets.

Private anchors affect how information is communicated and can improve or distort transmission.

problem How private anchors influence strategic communication and information transmission.
method Analyzed a sender-receiver game with costly reports and privately observed anchors.
result Small positive reporting costs can lead to full revelation, even with zero costs.

LargeMvC-Net improves scalability of multi-view clustering.

problem Scalability issues in multi-view clustering.
method Deep unfolding of multi-view clustering into a network architecture with three modules.
result LargeMvC-Net consistently outperforms state-of-the-art methods in scalability and effectiveness.

Proposes a TS approach for Bayesian optimization with preferential feedback.

problem Optimizing with preference feedback in complex applications.
method Uses Thompson Sampling with a dueling kernel and anchor invariance.
result Performance matches standard TS for scalar feedback in finite time.

Anchoring is a term used in psychology to describe the common human tendency to rely too heavily (anchor) on one piece of information when making decisions. A trading algorithm inspired by biological motors, introduced by L. Gil\cite{Gil}, is suggested as a testing ground for anchoring in financial markets. An exact so…

2007-05-23abs ↗pdf ↗

Separable Non-negative Matrix Factorization (SNMF) is an important method for topic modeling, where "separable" assumes every topic contains at least one anchor word, defined as a word that has non-zero probability only on that topic. SNMF focuses on the word co-occurrence patterns to reveal topics by two steps: anchor…

2019-05-10abs ↗pdf ↗

Market stability depends on a fundamental value anchor, not price crashes.

problem Stability of order-book markets under fundamental anchoring.
method Analytical model and empirical analysis of six transmission channels.
result Fundamental anchoring stabilizes markets by mean-reverting prices and refilling books; removing the anchor leads to market failure.

A new noise model for preferential Bayesian optimization using user anchors.

problem Inadequate assumption of homoscedastic noise in human-in-the-loop settings.
method Proposes a heteroscedastic noise model with anchors and a KDE uncertainty map.
result Risk-adjusted performance improvement and clarified anchor placement effects.

The formalism of anchor words has enabled the development of fast topic modeling algorithms with provable guarantees. In this paper, we introduce a protocol that allows users to interact with anchor words to build customized and interpretable topic models. Experimental evidence validating the usefulness of our approach…

2019-06-18abs ↗pdf ↗

A pre-Lie algebroid is an anchored bundle provided with an almost Lie bracket such that the anchor is compatible with the Lie bracket of vector fields. We firstly show how most geometrical structures intensively studied in the framework of Lie algebroid can easily be extended in the pre-Lie algebroid context. The princ…

2014-12-21abs ↗pdf ↗

Paper proposes an alternative to anchor points for learning with noisy labels.

problem Learning with noisy labels is challenging due to inaccurate labels.
method Estimates transition matrix using clusterability condition and noisy labels.
result Estimation of transition matrix is more accurate and efficient than anchor points.

A new method for efficient inference in sequential latent-variable models.

problem Computational challenges in integrating subject-specific random effects.
method Anchored variational inference framework to approximate posterior distributions.
result The method achieves accurate estimation with significant computational gains.

Anchor-TS uses median anchoring to improve online decision-making from offline data with distribution shift.

problem Improving online decision-making from offline data with distribution shift.
method Sample-Mean Anchored Thompson Sampling (Anchor-TS) with median anchoring.
result Anchor-TS safely leverages offline data to accelerate online learning and reduces regret.

In label-noise learning, \textit{noise transition matrix}, denoting the probabilities that clean labels flip into noisy labels, plays a central role in building \textit{statistically consistent classifiers}. Existing theories have shown that the transition matrix can be learned by exploiting \textit{anchor points} (i.e…

2019-06-01abs ↗pdf ↗

In topic modeling, many algorithms that guarantee identifiability of the topics have been developed under the premise that there exist anchor words -- i.e., words that only appear (with positive probability) in one topic. Follow-up work has resorted to three or higher-order statistics of the data corpus to relax the an…

2016-11-15abs ↗pdf ↗

Network alignment is a critical task to a wide variety of fields. Many existing works leverage on representation learning to accomplish this task without eliminating domain representation bias induced by domain-dependent features, which yield inferior alignment performance. This paper proposes a unified deep architectu…

2019-08-15abs ↗pdf ↗

Develops a new framework for temporal anchoring in deep embedding spaces.

problem Temporal anchoring in deep embedding spaces, especially drift and convergence issues.
method Operator-theoretic framework with drift maps and event-indexed blocks, proving convergence theorems and equivalence theorems.
result Proves convergence theorems and equivalence theorems for the proposed framework.

A framework visualizes embedding spaces of neural survival analysis models using anchor directions.

problem Visualizing complex embeddings in neural survival analysis models.
method Estimating anchor directions through clustering or user-supplied concepts, revealing relationships with raw inputs and survival times.
result Visualization strategies reveal how anchor directions relate to raw clinical features and survival time distributions.

First, we extend the notion of second order differential equations (SODE) on a smooth manifold to anchored Banach vector bundles. Then we define the Banach Lie algebroids as Lie algebroids structures modeled on anchored Banach vector bundles and prove that they form a category.

2010-03-05abs ↗pdf ↗

AutoAnchor uses cross-attention to improve text-to-image model unlearning.

problem Mitigating harmful or copyrighted content in text-to-image models.
method Two-stage framework that automatically synthesizes manifold-proximal anchors using cross-attention consistency loss.
result Effective robust and unbiased unlearning across various baselines.

Paper refines InfoNCE for accurate mutual information estimation.

problem Indirect connection of InfoNCE to mutual information estimation.
method Introduces InfoNCE-anchor with an auxiliary anchor class for consistent density ratio estimation.
result InfoNCE-anchor yields a plug-in MI estimator with significantly reduced bias.

Some tasks, such as surface normals or single-view depth estimation, require per-pixel ground truth that is difficult to obtain on real images but easy to obtain on synthetic. However, models learned on synthetic images often do not generalize well to real images due to the domain shift. Our key idea to improve domain …

2019-08-16abs ↗pdf ↗

Transformers improve Alzheimer's disease progression prediction by accounting for irregular biomarker histories.

problem Difficult prediction of medium-horizon Alzheimer's disease progression due to tied clinical scores and irregular biomarker observations.
method Developed a residual gap-aware transformer that combines statistical reference with transformer-based residual learning.
result The proposed model reduces mean error and improves prediction-observation correlation compared to baseline models.

This paper is devoted to the framework of direct limit of anchored Banach bundles over a convenient manifold which is a direct limit of Banach manifold. In particular we give a criterion of integrability for distributions on such convenient manifolds which are locally direct limits of particular sequences of Banach anc…

2014-08-16abs ↗pdf ↗

Results describing Lie ideals and maximal finite-codimensional Lie subalgebras of the Lie algebras associated with Lie algebroids with non-singular anchor maps are presented. It is also proved that every isomorphism of such Lie algebras induces a diffeomorphism of base manifolds respecting the generalized foliations de…

2002-03-06abs ↗pdf ↗

Under appropriate assumptions, we generalize the concept of linear almost Poisson struc- tures, almost Lie algebroids, almost differentials in the framework of Banach anchored bundles and the relation between these objects. We then obtain an adapted formalism for mechanical systems which is illustrated by the evolution…

2011-11-25abs ↗pdf ↗

In continual learning, the learner faces a stream of data whose distribution changes over time. Modern neural networks are known to suffer under this setting, as they quickly forget previously acquired knowledge. To address such catastrophic forgetting, many continual learning methods implement different types of exper…

2020-02-19abs ↗pdf ↗

We present a semi-supervised learning algorithm for learning discrete factor analysis models with arbitrary structure on the latent variables. Our algorithm assumes that every latent variable has an "anchor", an observed variable with only that latent variable as its parent. Given such anchors, we show that it is possi…

2015-11-10abs ↗pdf ↗

AGCA approximates angular variation on the unit sphere, reducing extremal dependence problems to eigenanalysis.

problem Approximating angular variation in multivariate extremes.
method Anchored geodesic component analysis (AGCA) approximates angular variation by great subspheres constrained to pass through a chosen reference direction.
result AGCA finds concentrated tail directions in daily equity-portfolio losses, explaining about 91% of anchored variation.

Learning node embeddings that capture a node's position within the broader graph structure is crucial for many prediction tasks on graphs. However, existing Graph Neural Network (GNN) architectures have limited power in capturing the position/location of a given node with respect to all other nodes of the graph. Here w…

2019-06-11abs ↗pdf ↗

PULSE estimator improves prediction in causal inference with bounded interventions.

problem Optimizing causal models for bounded interventions.
method Relates K-class estimators to anchor regression, introduces PULSE estimator for minimization of mean squared prediction error with bounded constraints.
result PULSE estimator outperforms other estimators in real data and simulation experiments, especially in weak instrument settings.