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

Trend · papers per month

6.3%12.5%18.8%25.0% · Oct 199319922001200920172026
48 results for measurement uninformative

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.

A technique called 'prior laundering' uses legacy reconstructions to create uncertainty in Bayesian inverse problems.

problem Uncertainty in Bayesian inverse problems when data is uninformative.
method Using an archive of legacy reconstructions to create uncertainty in the posterior distribution, averaging the legacy posterior over measurements.
result The uncertainty reported in the posterior is inherited from the legacy reconstructions, not from the data itself.

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.

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.

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.

Study examines insider trading in short-selling restricted markets.

problem Analyzing insider trading opportunities in short-selling prohibited markets.
method Introducing minimal supermartingale measure and analyzing its properties in relation to minimal martingale measure.
result Conditions under which both measures fail to exist, indicating insider information affecting market perception.

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.

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.

Active learning improves neutron spectroscopy experiments by automating measurement selection.

problem Efficiently searching for signals in neutron scattering experiments with limited beam time.
method Probabilistic active learning using log-Gaussian processes.
result Automated selection of informative measurements improves experimental efficiency.

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.

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 ↗

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 ↗

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.

Paper introduces ENZ to measure significant coefficients in sparse recovery, improving over classical methods.

problem Numerical noise creates long tails of negligible coefficients in sparse recovery.
method Entropy-based notion of effective sparsity (ENZ) to measure significant coefficients, proving stability under restricted isometry condition.
result ENZ decomposes into support cardinality and efficiency factor, providing a precise measure of sparsity.

DWTS uses observational data to improve clinical trial efficiency.

problem Lack of definitive conclusions from randomized clinical trials due to insufficient patient cohorts and confounding biases.
method DWTS combines observational data with randomized clinical trials using Doubly Debiased LASSO (DDL) to identify reliable covariates.
result DWTS reduces cumulative regret in clinical trials compared to standard methods.

Interpreting black box classifiers, such as deep networks, allows an analyst to validate a classifier before it is deployed in a high-stakes setting. A natural idea is to visualize the deep network's representations, so as to "see what the network sees". In this paper, we demonstrate that standard dimension reduction m…

2018-03-11abs ↗pdf ↗

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 ability to automatically estimate the quality and coverage of the samples produced by a generative model is a vital requirement for driving algorithm research. We present an evaluation metric that can separately and reliably measure both of these aspects in image generation tasks by forming explicit, non-parametric…

2019-04-15abs ↗pdf ↗

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.

Algorithm recovers factors of rank-1 matrices from noisy measurements.

problem Estimating factors of a rank-1 matrix from nonlinearly transformed and noisy measurements.
method Alternating minimization with random initialization and analysis of empirical error recursion.
result Algorithm converges geometrically fast from random initialization, with sharp guarantees.

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 ↗

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.

Exploratory data analysis is crucial for developing and understanding classification models from high-dimensional datasets. We explore the utility of a new unsupervised tree ensemble called uncharted forest for visualizing class associations, sample-sample associations, class heterogeneity, and uninformative classes fo…

2018-02-11abs ↗pdf ↗

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.

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.

An optimal feedback controller for a given Markov decision process (MDP) can in principle be synthesized by value or policy iteration. However, if the system dynamics and the reward function are unknown, a learning agent must discover an optimal controller via direct interaction with the environment. Such interactive d…

2019-07-06abs ↗pdf ↗

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.

Letter analyzes training dynamics of a nonlinear contrastive learning model in high dimensions.

problem Understanding training dynamics of nonlinear contrastive learning models in high-dimensional settings.
method High-dimensional analysis using McKean-Vlasov PDEs and low-dimensional ODEs.
result The model's performance evolves according to specific ODEs, revealing features like feature learnability and noise effects.

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 ↗

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.

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.

Objective: To determine the completeness of argumentative steps necessary to conclude effectiveness of an algorithm in a sample of current ML/AI supervised learning literature. Data Sources: Papers published in the Neural Information Processing Systems (NeurIPS, née NIPS) journal where the official record showed a 2017…

2018-12-18abs ↗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 ↗