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

Trend · papers per month

295786114 · Jan 202619922001200920182026
48 results for anonymous markets

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.

UNMIX identifies hidden buyers in darknet markets by clustering anonymized IDs.

problem Identifying hidden buyers in darknet markets where IDs are anonymized.
method UNMIX, a hidden buyer identification model using Dirichlet Hawkes Process.
result UNMIX successfully groups transactions from one hidden buyer into one cluster.

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.

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.

Paper anonymizes user ratings to protect privacy while improving recommendation accuracy.

problem Protecting user privacy while maintaining recommendation accuracy with anonymized ratings.
method Exhaustively lists recommender models using anonymized ratings and presents item-based collaborative filtering algorithms.
result Item-based collaborative filtering based on anonymized ratings outperforms non-anonymized ratings in some settings.

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.

RL improves market making with historical data time travel.

problem Limited ability to simulate and fully appraise the impact of actions in competitive systems.
method Introduces 'consistent data time travel' to adjust historical data time index.
result Significant improvement in agent's gain with data time travel.

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.

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.

Study finds price impact follows a 'double' square-root law, suggesting mechanical origin.

problem Understanding the origin of price impact in markets.
method Detailed dataset of Tokyo Stock Exchange orders, analyzing single and metaorders.
result Price impact follows a 'double' square-root law, indicating mechanical origin rather than information.

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.

We introduce a multivariate Hawkes process that accounts for the dynamics of market prices through the impact of market order arrivals at microstructural level. Our model is a point process mainly characterized by 4 kernels associated with respectively the trade arrival self-excitation, the price changes mean reversion…

2013-01-07abs ↗pdf ↗

Paper develops a neural network method to anonymize data without losing important information.

problem Protecting sensitive information while preserving useful data for analysis.
method Adversarial neural networks training with three sub-networks to prevent private labels from being predictive.
result Demonstrated success in anonymizing handwritten digits and sentiment analysis data.

Modeling market dynamics with informed and uninformed traders and fads.

problem Optimizing market making in a market with fads, informed, and uninformed traders.
method Characterizing the optimal liquidity provision problem in a market with fads, informed, and uninformed traders, considering both complete and partial information.
result The price of liquidity is a function of the proportion of informed traders, and strategies ignoring fads underperform.

Paper investigates preserving anomalous subgroups in anonymized datasets.

problem Preserving anomalous subgroups in machine learning transformed data.
method Trained a binary classifier to discover anomalous subgroups, then used variational autoencoder (VAE) to anonymize data.
result Synthesized datasets preserved high subgroup differentiation as in original data.

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.

Study compares altcoins to Bitcoin, analyzing their features and market performance.

problem Comparing altcoins to Bitcoin to understand market performance and features.
method Used Google Trend data, price, volume, and market capitalization data from coinmarketcap.com.
result Features of Litecoin, Zcash, Bitcoin Cash, Ethereum, and Bitcoin Gold affect market performance and user preferences.

Study shows how 'crowding' in equity trading affects performance and costs.

problem Deterioration of strategy performance, increased trading costs, and systemic risk due to equity factor crowding.
method Direct metrics of crowding based on imbalances of trades executed on the market, analyzing U.S. equity market data.
result Significant signs of crowding in well-known equity signals, especially Momentum, affecting order flow and portfolio rebalancing.

The study confirms that market volatility can be explained by correlated metaorders impacting prices in a square-root fashion.

problem Explaining market volatility using metaorders and their impact.
method Generated synthetic market data and analyzed the correlation between order flow and returns.
result The square-root law of market impact is confirmed and can be measured from anonymized trade data.

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.

Generative model generates synthetic medical images for data augmentation and anonymization.

problem Imbalanced medical imaging data sets, especially for rare pathologies.
method Generative adversarial network (GAN) trained on two public brain MRI datasets.
result Synthetic images improve tumor segmentation performance and serve as an anonymization tool.

Scores political leanings in Web3 betting markets.

problem Understanding political motivations in decentralized prediction markets.
method Constructing PBLS from Polymarket data, analyzing 15k addresses, 4k events, 8k markets.
result Validated PBLS through internal and external comparisons, revealing political and profit motives.

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.

Study shows awareness of reflexivity improves LLMs' financial forecasting accuracy.

problem Improving LLMs' ability to forecast financial markets during boom-bust cycles.
method Evaluated three LLMs under four conditions of reflexivity awareness in two market episodes.
result Reflexivity awareness improves forecasting accuracy differently across models and contexts.

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.

Maximize revenue by guiding individuals to optimal locations anonymously.

problem Matching supply and demand in online to offline services efficiently.
method Employing maximum entropy principle for independent learning with local aggregated information.
result Significant improvement in joint and individual revenue with fairness.

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.

GraLSP improves graph neural networks by incorporating local structural patterns.

problem GNNs struggle with identifying common structural patterns in graphs.
method GraLSP uses random anonymous walks to capture local graph structures and incorporates these into feature aggregation mechanisms.
result GraLSP outperforms other models in various prediction tasks on multiple datasets.