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

Trend · papers per month

59118176235 · Jun 202019922001200920172026
48 results for uninformative labels

Adding uninformative labels improves tumor segmentation in low-data mammography.

problem Improving tumor segmentation in mammography with limited data.
method Used seemingly uninformative labels from non-expert annotators to turn a multi-label task into a multi-class problem.
result Performance gains in tumor segmentation are achieved in low-data settings with additional uninformative labels.

Neural networks compress uninformative input directions, improving test error.

problem Data lie in a high-dimensional space but labels vary along a lower-dimensional manifold.
method One-hidden layer network trained with gradient descent, analyzing weight evolution and compression.
result Compression factor λ ∼ √p improves test error, with β Feature > β Lazy.

The paper sets bounds on how much regret is unavoidable in adaptive LQR with unknown B-matrix.

problem Understanding the limits of adaptive LQR with unknown B-matrix.
method Local asymptotic minimax regret lower bounds using van Trees' inequality and Bellman error representation.
result Logarithmic regret is impossible if the parametrization induces an uninformative optimal policy.

Process mining is a research field focused on the analysis of event data with the aim of extracting insights in processes. Applying process mining techniques on data from smart home environments has the potential to provide valuable insights in (un)healthy habits and to contribute to ambient assisted living solutions. …

2016-09-12abs ↗pdf ↗

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.

Detecting and recovering labels in binomial logistic mixtures is challenging due to an information gap.

problem Detecting and recovering labels in binomial logistic mixtures
method Propose two feasibility-aware inference procedures
result Avoid misleading component selections and improve label probability calibration

Study shows mutual funds add little value for uninformed investors.

problem Understanding the performance of actively managed equity mutual funds for uninformed investors.
method Constructed a reference portfolio using prices and supply information, analyzed various subsets of funds, and compared to market index.
result Mutual funds provide insignificant alpha for uninformed investors, with negative and significant alpha when compared to the market index.

Informed traders strategically reveal noisier signals, making prices less responsive to public information.

problem How informed traders strategically reveal signals impacts market prices and utility.
method Modeling a market with an informed trader, an uninformed trader, and liquidity providers, proving equilibrium existence.
result In equilibrium, the insider strategically reveals a noisier signal, making prices less responsive to public information.

AutoElicit uses LLMs to quickly create expert priors for predictive models.

problem Creating accurate priors for predictive models is time-consuming and costly.
method AutoElicit extracts knowledge from LLMs to construct priors for predictive models.
result AutoElicit yields priors that reduce error and save labelling effort.

New geometric interpretation explains over-parameterized models and adversarial perturbations.

problem Geometric understanding of over-parameterized regression and adversarial perturbations.
method Alternative geometric interpretation of regression in feature space.
result Adversarial perturbations are a natural feature of biased models due to underlying geometry.

Study dynamic equilibrium with insider and general uninformed agent preferences.

problem Analyzing asymmetric information and general utility functions in a continuous-time economy.
method Introducing a new method to prove existence of a partial communication equilibrium (PCE) for agents with general utility functions.
result Identify the equilibrium price in the small and large risk aversion limits for agents with power utility.

New method speeds up Bayesian inference for complex simulators.

problem Challenges in Bayesian inference for complex stochastic simulators with intractable likelihood functions.
method Optimization Monte Carlo framework reformulated as deterministic optimization problems with gradient-based methods.
result Accurate posterior inference with reduced runtimes compared to existing methods.

This paper uses reference priors to improve deep learning models with unlabeled and labeled data.

problem Improving deep learning models with limited labeled data and unlabeled data from the same or related tasks.
method Develops and applies generalizations of reference priors for deep networks to exploit unlabeled and labeled data.
result Demonstrates new semi-supervised learning and pretraining methods for transfer learning.

In this paper, we study the convergence of generative adversarial networks (GANs) from the perspective of the informativeness of the gradient of the optimal discriminative function. We show that GANs without restriction on the discriminative function space commonly suffer from the problem that the gradient produced by …

2019-02-15abs ↗pdf ↗

A simple strategy optimizes broker-client trading, reducing price discounts for informed traders.

problem Optimizing broker-client trading to balance client flow and informed trader losses.
method Modelled as a stochastic control problem, derived optimal strategy in closed form, introduced algorithm.
result Optimal strategy reduces price discounts for informed traders, balancing client flow and informed trader losses.

Reconstruction-based learning produces uninformative features for perception tasks.

problem Misalignment between reconstruction-based learning and perception tasks.
method Investigated the impact of input space reconstruction on feature learning for perception tasks.
result Reconstruction-based learning allocates model capacity to a subspace with uninformative features for perception tasks.

This paper provides new insight into maximizing F1 scores in the context of binary classification and also in the context of multilabel classification. The harmonic mean of precision and recall, F1 score is widely used to measure the success of a binary classifier when one class is rare. Micro average, macro average, a…

2014-02-08abs ↗pdf ↗

SaliencyMix augments images with salient patches to improve model generalization.

problem Improving deep learning model generalization through better data augmentation.
method Carefully selects salient patches from images and mixes them with the target image.
result Achieves state-of-the-art top-1 error rates and robustness against adversarial attacks.

Adaptive coverage policies improve conformal prediction accuracy.

problem Fixed coverage levels in traditional conformal prediction lead to uninformative predictions.
method Optimizes adaptive coverage policy using a neural network trained on leave-one-out calibration.
result Adaptive coverage policies produce more informative and flexible prediction sets.

This paper studies how AMMs can minimize losses from arbitrage while retaining uninformed trading activity.

problem Minimizing losses from arbitrage in AMMs while retaining uninformed trading activity.
method Modeling arbitrage dynamics and sensitivity to fee choices, mapping to a random walk with a reward scheme.
result AMMs can maximize value retention by optimizing fee structures.

New saliency evaluations focus on completeness and soundness, improving explanations.

problem Current saliency evaluations focus on completeness but ignore soundness.
method Introduces new intrinsic evaluation metrics based on completeness and soundness.
result Simple saliency method matches or outperforms prior methods in new evaluations.

Study shows pre-event L2 liquidity state predicts crypto futures liquidity better than event labels.

problem Understanding how crypto futures liquidity changes over time.
method Combining L2 order book data, trade-flow records, and macro-event windows to define discrete liquidity-state transitions and evaluate models.
result Pre-event L2 liquidity state predicts post-event liquidity regimes better than event labels, and order flow adds value only when layered on top of the state model.

We extend the theory of asymmetric information in mispricing models for stocks following geometric Brownian motion to constant relative risk averse investors. Mispricing follows a continuous mean--reverting Ornstein--Uhlenbeck process. Optimal portfolios and maximum expected log--linear utilities from terminal wealth f…

2011-01-06abs ↗pdf ↗

The paper discusses the impact of prior densities on Bayesian model selection.

problem The sensitivity of marginal likelihood to prior choice in Bayesian model selection.
method Analyzes the role of prior densities in model selection, discusses improper priors, and proposes solutions.
result Marginal likelihood can be sensitive to prior choice, but improper priors can still be used with caution.

PARIS reduces imbalanced regression datasets by pruning uninformative samples.

problem Imbalanced regression where models focus on high-frequency regions, ignoring rare but impactful events.
method PARIS uses the representer theorem to compute a closed-form representer deletion residual for iterative pruning of the training set.
result PARIS reduces training set by up to 75% while preserving or improving overall performance, outperforming other methods.

Paper identifies problematic baselines in Shapley value explanations and proposes a reweighting mechanism.

problem Identifying and addressing the suboptimality of baselines in Shapley value feature importance analysis.
method Analyzed suboptimality of baselines, identified problematic baseline, generalized uninformativeness, and designed a reweighting mechanism.
result Proposed uncertainty-based reweighting mechanism effectively accelerates computation and improves explanation quality.

New algorithm reduces online learning regret in uninformed Markov games.

problem Achieving no external regret in uninformed Markov games is impossible.
method Empirical Nash-value regret, parameter-free algorithm, adaptive restart.
result Achieves O(min{K+(CK)1/3,LK})O(\min \{\sqrt{K} + (CK)^{1/3},\sqrt{LK}\}) regret bound.

Advocates against over-smoothing and over-squashing in GNNs, suggesting they are less critical than previously thought.

problem Over-smoothing and over-squashing in Graph Neural Networks (GNNs).
method Challenged the prevailing focus on these phenomena, proposing that performance decreases are due to uninformative receptive fields and localised information distribution.
result Performance decreases are mostly uncorrelated with over-smoothing and over-squashing, and optimal model depths remain small.

We propose a new family of optimization criteria for variational auto-encoding models, generalizing the standard evidence lower bound. We provide conditions under which they recover the data distribution and learn latent features, and formally show that common issues such as blurry samples and uninformative latent feat…

2017-02-28abs ↗pdf ↗

Study shows overparametrization can shift and bend loss landscapes, affecting signal recovery.

problem Understanding how overparametrization affects loss landscapes in neural networks.
method Field theory analysis of Hessian spectrum at initialization.
result Overparametrization can shift the BBP transition point, potentially reaching weak-recovery threshold.

LOBSTUR-GNN adapts bootstrapping for unsupervised GNNs, improving node representation learning.

problem Hyperparameter tuning and lack of established methodologies for unsupervised GNNs.
method Adapts bootstrapping techniques for local graph dependencies and uses CCA for embedding consistency.
result 65.9% improvement in classification accuracy compared to uninformed hyperparameter selection.

This paper investigates the equilibrium interactions between trading targets and private information in a multi-period Kyle (1985) market. There are two investors who each follow dynamic trading strategies: A strategic portfolio rebalancer who engages in order splitting to reach a cumulative trading target and an uncon…

2015-02-07abs ↗pdf ↗

The study examines when large trades are considered news or liquidity shocks in a market model.

problem Understanding when large trades are news or liquidity shocks in a market model.
method A sequential competitive limit order book model with asymmetric information and Student-t tails for liquidity demand.
result Heavy-tailed liquidity demand flattens and concavifies price impact, delaying price discovery.

Variational inference is a powerful tool for approximate inference. However, it mainly focuses on the evidence lower bound as variational objective and the development of other measures for variational inference is a promising area of research. This paper proposes a robust modification of evidence and a lower bound for…

2016-11-28abs ↗pdf ↗

The choice of sentence encoder architecture reflects assumptions about how a sentence's meaning is composed from its constituent words. We examine the contribution of these architectures by holding them randomly initialised and fixed, effectively treating them as as hand-crafted language priors, and evaluating the resu…

2019-10-04abs ↗pdf ↗

This paper studies an optimal trading problem that incorporates the trader's market view on the terminal asset price distribution and uninformative noise embedded in the asset price dynamics. We model the underlying asset price evolution by an exponential randomized Brownian bridge (rBb) and consider various prior dist…

2017-12-31abs ↗pdf ↗