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

2468 · May 202619922001200920172026
48 results for ticker anonymization

A blindfolded LLM trading framework validates market signals without ticker memorization.

problem Ensuring LLMs trade based on genuine market understanding, not memorized data.
method Anonymize tickers and company names, verify signals through reasoning embeddings, and use PPO-DSR policy.
result Achieved Sharpe ratio of 1.40 +/- 0.22 across 20 seeds, robust in volatile markets.

Benchmark evaluates LLM trading agents by masking identifiers to prevent memory leaks.

problem Evaluate LLM trading agents without relying on market memory or noise.
method Data-side masking protocol, Barra-style performance attribution framework.
result LLM agents' returns are largely explained by market and style exposure, not stock selection.

A framework for anonymized risk sharing without revealing identities or preferences.

problem Risk sharing without revealing individual identities or preferences.
method Axiomatic framework with four key axioms: actuarial fairness, risk fairness, risk anonymity, and operational anonymity.
result The conditional mean risk sharing rule is uniquely characterized by these axioms.

Anonymization reduces economic signal extraction from financial texts.

problem Reducing meaningful economic signals from financial texts due to anonymization.
method Analyzed the impact of anonymization on textual understanding and economic signal extraction.
result Information loss due to anonymization is severe and pervasive, outweighing its benefits in certain financial applications.

Recommender systems are widely used to predict personalized preferences of goods or services using users' past activities, such as item ratings or purchase histories. If collections of such personal activities were made publicly available, they could be used to personalize a diverse range of services, including targete…

2017-06-06abs ↗pdf ↗

For a dataset of label-count pairs, an anonymized histogram is the multiset of counts. Anonymized histograms appear in various potentially sensitive contexts such as password-frequency lists, degree distribution in social networks, and estimation of symmetric properties of discrete distributions. Motivated by these app…

2019-10-08abs ↗pdf ↗

We study a variant of the stochastic KK-armed bandit problem, which we call "bandits with delayed, aggregated anonymous feedback". In this problem, when the player pulls an arm, a reward is generated, however it is not immediately observed. Instead, at the end of each round the player observes only the sum of a number…

2017-09-20abs ↗pdf ↗

Graph matching in noisy environments with Markovian errors.

problem Graph matching under time-dependent Markovian noise.
method Introduced edgelighter error model and analyzed graph matching thresholds.
result Graph matching thresholds and mixing times are of order Θ(n2logn)Θ(n^2\log n) for Erdős-Rényi graphs, and O(nαlogn)O(n^α\log n) for Stochastic Block Model graphs.

The social media revolution has produced a plethora of web services to which users can easily upload and share multimedia documents. Despite the popularity and convenience of such services, the sharing of such inherently personal data, including speech data, raises obvious security and privacy concerns. In particular, …

2019-05-30abs ↗pdf ↗

The study examines how brokers' identity affects their trading strategies on the Toronto Stock Exchange.

problem Impact of anonymous trading on brokers' optimal execution strategies.
method Formulated a stochastic differential game and mean-field game to analyze the optimal execution problem of anonymous and identity-revealed trading.
result Obtained a closed-form solution for the optimal strategy under Almgren-Chris price impact framework.

Adaptive MAB algorithms handle composite, anonymous feedback without reward interval knowledge.

problem Multi-armed bandit with composite and anonymous feedback, especially without reward interval size knowledge.
method Proposed adaptive algorithms for stochastic and adversarial cases, without reward interval knowledge.
result First algorithm for adversarial case handling non-oblivious adversary and unknown reward interval size.

Preserving the privacy of individuals by protecting their sensitive attributes is an important consideration during microdata release. However, it is equally important to preserve the quality or utility of the data for at least some targeted workloads. We propose a novel framework for privacy preservation based on the …

2017-11-05abs ↗pdf ↗

We explore a novel setting of the Multi-Armed Bandit (MAB) problem inspired from real world applications which we call bandits with "stochastic delayed composite anonymous feedback (SDCAF)". In SDCAF, the rewards on pulling arms are stochastic with respect to time but spread over a fixed number of time steps in the fut…

2019-10-02abs ↗pdf ↗

TIPRDC anonymizes data features to protect privacy while retaining useful information.

problem Privacy concerns from crowdsourced data hinder deep learning applications.
method Hybrid training method combining adversarial and mutual information estimation.
result Feature extractor hides private information while preserving original data features.

This work synthesizes realistic data from neural excitation patterns to anonymize private data.

problem Lack of usable training data due to privacy regulations.
method Synthesize realistic data by exciting trained deep neural network neurons.
result Synthesized data can generalize well and anonymize participants' identities.

Motion sensors such as accelerometers and gyroscopes measure the instant acceleration and rotation of a device, in three dimensions. Raw data streams from motion sensors embedded in portable and wearable devices may reveal private information about users without their awareness. For example, motion data might disclose …

2018-10-26abs ↗pdf ↗

The paper analyzes how clustering sensitive data can improve model generalization without revealing individual information.

problem Ensuring user data privacy in personalized recommendation systems.
method Look-alike clustering to replace sensitive features with cluster averages, analyzed using Convex Gaussian Minimax Theorem.
result Training models using anonymous cluster centers can improve generalization error, especially in high-dimensional settings.

Statistical methods protecting sensitive information or the identity of the data owner have become critical to ensure privacy of individuals as well as of organizations. This paper investigates anonymization methods based on representation learning and deep neural networks, and motivated by novel information theoretica…

2018-02-26abs ↗pdf ↗

Anonymizing company names in financial news improves trading performance, contrary to initial expectations.

problem Look-ahead and distraction biases in sentiment analysis of financial news.
method Investigated trading strategies based on original and anonymized headlines, comparing performance.
result Anonymized headlines outperform original in-sample, suggesting distraction effect is stronger.

Zero-Copy Architecture Detects Cross-Company Financial Signals Instantly.

problem Financial models miss cross-company disruptions due to static data.
method Heterogeneous Rust-Python streaming architecture that maps cross-company attention as a continuous-time graph.
result Zero-copy parsing and inference process delivers real-time cross-company signal detection.

Study non-oblivious adversarial bandits with delayed feedback and propose algorithms with improved regret bounds.

problem Adversarial bandit problem with delayed, composite anonymous feedback.
method Propose wrapper algorithm for non-oblivious delay setting, achieving o(T)o(T) policy regret.
result Achieve o(T)o(T) policy regret for many adversarial bandit problems with bounded memory loss sequences.

We analyze a proprietary dataset of trades by a single asset manager, comparing their price impact with that of the trades of the rest of the market. In the context of a linear propagator model we find no significant difference between the two, suggesting that both the magnitude and time dependence of impact are univer…

2017-02-26abs ↗pdf ↗

The paper explores how to measure and optimize ad reach while maintaining user privacy.

problem Measuring ad reach while preserving user privacy in online advertising.
method Introduces kk-anonymity and probabilistic discounting for frequency capping.
result Privacy introduces a significant performance drop but with manageable costs.

The task of representing entire graphs has seen a surge of prominent results, mainly due to learning convolutional neural networks (CNNs) on graph-structured data. While CNNs demonstrate state-of-the-art performance in graph classification task, such methods are supervised and therefore steer away from the original pro…

2018-05-30abs ↗pdf ↗

This study addresses an issue of co-adaptation between a feature extractor and a classifier in a neural network. A naive joint optimization of a feature extractor and a classifier often brings situations in which an excessively complex feature distribution adapted to a very specific classifier degrades the test perform…

2019-06-04abs ↗pdf ↗

Differentially private GANs improve image privacy without significant quality loss.

problem Anonymizing image data sets while maintaining image quality.
method Training GANs with differential privacy on MNIST, analyzing privacy-utility trade-offs and explaining optimization methods.
result An increasing privacy budget adds little to generated image quality, revealing a saturated training regime.

In this work, we propose an order book model with herd behavior. The proposed model is built upon two distinct approaches: a recent empirical study of the detailed order book records by Kanazawa et al. [Phys. Rev. Lett. 120, 138301] and financial herd behavior model. Combining these approaches allows us to propose a mo…

2018-09-08abs ↗pdf ↗

Breaks circular dependency in synthetic option pricing with a novel model.

problem Circular dependency in implied volatility limits synthetic data for machine learning and risk analysis.
method Uses a Jump-Hidden Markov Model to generate price paths and a modified Heston process to convert paths into implied volatility.
result Framework generates realistic synthetic American option prices without external calibration.

This study analyzes dynamic connectedness in global supply chain infrastructure portfolios, identifying key risk factors and extreme events.

problem Understanding dynamic connectedness in global supply chain infrastructure portfolios under various risk factors and extreme events.
method Time-varying parameter vector autoregression (TVP-VAR) model to study spillover and interconnectedness of risk factors.
result Risk shocks influence dynamic connectedness between portfolios and risk factors, and extreme events affect investment outcomes.

CAWs learn temporal network dynamics without node identities or edge attributes.

problem Learning temporal network dynamics without node identities or edge attributes.
method Causal Anonymous Walks (CAWs) using temporal random walks and hitting counts.
result CAW-N outperforms previous methods in predicting links over 6 real temporal networks.

Efficient sequential matching of supply and demand is a problem of interest in many online to offline services. For instance, Uber, Lyft, Grab for matching taxis to customers; Ubereats, Deliveroo, FoodPanda etc for matching restaurants to customers. In these online to offline service problems, individuals who are respo…

2018-03-27abs ↗pdf ↗

Framework for AI customer support that protects privacy and reduces costs.

problem Privacy risks and compliance challenges in AI customer support.
method Zero-shot learning with large language models, real-time data anonymization, retrieval-augmented generation, robust post-processing.
result Reduces privacy risks and compliance costs while maintaining accuracy.

It is not until recently that graph neural networks (GNNs) are adopted to perform graph representation learning, among which, those based on the aggregation of features within the neighborhood of a node achieved great success. However, despite such achievements, GNNs illustrate defects in identifying some common struct…

2019-11-18abs ↗pdf ↗

Interest surrounding cryptocurrencies, digital or virtual currencies that are used as a medium for financial transactions, has grown tremendously in recent years. The anonymity surrounding these currencies makes investors particularly susceptible to fraud---such as "pump and dump" scams---where the goal is to artificia…

2019-02-04abs ↗pdf ↗

We confirm the square-root law of market impact on Apple Inc. using a large dataset.

problem Testing the square-root law of market impact on a single U.S. large-cap equity.
method Using a full market-by-order feed, we reconstruct metaorders and calibrate impact using the square-root formula.
result The square-root law is confirmed with a prefactor of 0.34, consistent with worldwide data.

Uncoupled regression is the problem to learn a model from unlabeled data and the set of target values while the correspondence between them is unknown. Such a situation arises in predicting anonymized targets that involve sensitive information, e.g., one's annual income. Since existing methods for uncoupled regression …

2019-05-31abs ↗pdf ↗