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

Trend · papers per month

11233445 · May 202619922001200920172026
48 results for Median Anchoring

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.

New method explains survival analysis models using median-SHAP.

problem Need for explainable AI in medical applications, especially for survival analysis.
method Introduces median-SHAP for explaining survival analysis models.
result Conventionally used mean anchor point can lead to misleading interpretations; median-SHAP provides a better approach.

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.

We construct compactifications for median spaces with compact intervals, generalising Roller boundaries of CAT(0){\rm CAT}(0) cube complexes. Examples of median spaces with compact intervals include all finite rank median spaces and all proper median spaces of infinite rank. Our methods also work for general median algebra…

2017-08-03abs ↗pdf ↗

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 ↗

Study on median algebra structures on Euclidean spaces and manifolds with local CAT(0) cubulation.

problem Understanding median algebra structures on Euclidean spaces and manifolds.
method Showed local CAT(0) cubulation for median structures on ER homology manifolds.
result Median structures on ER homology manifolds have a local CAT(0) cubulation structure.

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.

We prove a version of the Tits alternative for groups acting on complete, finite rank median spaces. This shows that group actions on finite rank median spaces are much more restricted than actions on general median spaces. Along the way, we extend to median spaces the Caprace-Sageev machinery and part of Hagen's theor…

2017-08-03abs ↗pdf ↗

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 ↗

We show that uniform lattices of isometries of products of real hyperbolic spaces act properly discontinuously and cocompactly on a median space. For lattices in products of at least two factors, this is the strongest degree of compatibility possible with the median geometry. Our theorem is also relevant for potential …

2017-08-01abs ↗pdf ↗

We introduce and begin to explore the mean and median of finite sets of shapes represented as integral currents. The median can be computed efficiently in practice, and we focus most of our theoretical and computational attention on medians. We consider questions on the existence and regularity of medians. While the me…

2018-02-14abs ↗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.

A method for estimating the median of gradients in stochastic optimization.

problem Robust gradient estimation in stochastic optimization for various applications.
method Stochastic Proximal Point Method for median gradient estimation.
result The proposed method can converge even under heavy-tailed, state-dependent noise.

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 ↗

This paper introduces online algorithms to estimate robust geometric median in large data streams.

problem Detecting outliers in large data sets using robust statistical measures.
method Online stochastic Newton methods for estimating the geometric median.
result Rates of convergence for online estimation of the geometric median.

The study finds that maximizing median returns is the only viable strategy in portfolio selection.

problem Difficulties in studying optimal portfolio strategies due to discontinuity and time inconsistency in maximizing median and quantile returns.
method Used intra-personal equilibrium approach to analyze portfolio selection under median and quantile maximization.
result Median maximization is the only viable strategy, with no investment in risky assets for other quantiles.

The consistency of Fréchet medians is proved for probability measures in proper metric spaces. In the context of Riemannian manifolds, assuming that the probability measure has more than a half mass lying in a convex ball and verifies some concentration conditions, the positions of its Fréchet medians are estimated. It…

2011-10-18abs ↗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.

In high dimensions, the mean and geometric median are nearly identical.

problem Understanding the relationship between mean and geometric median in high-dimensional spaces.
method Analytical derivation and simulation of the distance between mean and geometric median.
result The distance between mean and geometric median vanishes with dimensionality in high dimensions.