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

2825658471,129 · Jun 202019922001200920172026
48 results for poor data

In many situations, we need to build and deploy separate models in related environments with different data qualities. For example, an environment with strong observation equipments (e.g., intensive care units) often provides high-quality multi-modal data, which are acquired from multiple sensory devices and have rich-…

2018-09-06abs ↗pdf ↗

A special spine of a three-manifold is said to be poor if it does not contain proper simple subpolyhedra. Using the Turaev-Viro invariants, we establish that every compact three-dimensional manifold M with connected nonempty boundary has a finite number of poor special spines. Moreover, all poor special spines of the m…

2015-05-21abs ↗pdf ↗

New bounds for high-dimensional sparse linear bandits, balancing information and regret.

problem Stochastic linear bandits with high-dimensional sparse features.
method Derivation of minimax regret lower and upper bounds for explore-then-commit algorithm.
result Optimal rate of Θ(n2/3)Θ(n^{2/3}) for data-poor regime, complemented by O(n)O(\sqrt{n}) under signal magnitude assumption.

Poor (even random) starting points for learning/training/optimization are common in machine learning. In many settings, the method of Robbins and Monro (online stochastic gradient descent) is known to be optimal for good starting points, but may not be optimal for poor starting points -- indeed, for poor starting point…

2016-02-09abs ↗pdf ↗

A dynamic agent model is introduced with an annual random wealth multiplicative process followed by taxes paid according to a linear wealth-dependent tax rate. If poor agents pay higher tax rates than rich agents, eventually all wealth becomes concentrated in the hands of a single agent. By contrast, if poor agents are…

2017-11-15abs ↗pdf ↗

Machine learning suffers from poor design, data, and evaluation practices.

problem Ad hoc design, poor data hygiene, and lack of statistical rigor in model evaluation.
method Examines the entire machine learning process from design to evaluation, highlighting common pitfalls and providing recommendations.
result Common pitfalls in machine learning research and development are identified and actionable recommendations are provided.

Poor approximators found in neural networks and random feature models.

problem Understanding why certain neural networks and models perform poorly in approximating functions.
method Established a scale separation of Kolmogorov width type and applied it to neural networks and random feature models.
result Reproducing kernel Hilbert spaces and two-layer neural networks are poor L2L^2-approximators for certain functions.

Investor skill levels affect optimal portfolio size, study shows.

problem Optimal portfolio size for different skill levels of investors.
method Mathematical methods to study annual and continuous portfolio diversification, regression analysis.
result Strong investors should hold concentrated portfolios, poor investors should hold diversified portfolios.

New findings reveal discount regularization can be seen as a strong prior, leading to poor performance in unevenly sampled data.

problem Discount regularization leads to poor performance in unevenly sampled data.
method Equivalence theorem showing discount regularization as a strong prior, setting regularization parameters locally for individual state-action pairs.
result Discount regularization can be seen as a strong prior, leading to poor performance in unevenly sampled data.

Classifiers trained on data sets possessing an imbalanced class distribution are known to exhibit poor generalisation performance. This is known as the imbalanced learning problem. The problem becomes particularly acute when we consider incremental classifiers operating on imbalanced data streams, especially when the l…

2014-05-09abs ↗pdf ↗

The Bellman error is a poor proxy for value function accuracy, even with all state-action pairs.

problem The Bellman error is a poor proxy for the accuracy of the value function.
method Study of the Bellman equation as a surrogate objective for value prediction accuracy.
result The magnitude of the Bellman error is only weakly related to the distance to the true value function, even with all state-action pairs.

The aim of these notes is to relate covariant stochastic integration in a vector bundle EE (as in Norris \cite{Norris}) with the usual Stratonovich calculus via the connector $\K:TE \rightarrow E$ (cf. e.g. Paterson \cite{Paterson} or Poor \cite{Poor}) which carries the connection dependence.

2011-12-21abs ↗pdf ↗

Gaussian processes are a flexible Bayesian nonparametric modelling approach that has been widely applied but poses computational challenges. To address the poor scaling of exact inference methods, approximation methods based on sparse Gaussian processes (SGP) are attractive. An issue faced by SGP, especially in latent …

2019-10-13abs ↗pdf ↗

Framework for pricing data products in data-poor markets.

problem Challenges in pricing advanced data products due to lack of transaction data.
method Prior-predictive Monte Carlo framework for generating probabilistic price bands.
result Stable probabilistic price bands for data products in data-poor markets.

Study shows influence functions are poor for neural networks but useful for identifying influential examples.

problem Influence functions misalign with leave-one-out retraining in neural networks.
method Decomposed the discrepancy into five terms and studied their contributions across different architectures and datasets.
result Influence functions are a good approximation to the proximal Bregman response function (PBRF), useful for identifying influential examples.

We compare observed corporate cumulative default probabilities to those calculated using a stochastic model based on an extension of the work of Black and Cox and find that corporations default as if via diffusive dynamics. The model, based on a contingent-claims analysis of corporate capital structure, is easily calib…

2000-12-29abs ↗pdf ↗

New federated learning protocols improve on knowledge distillation's poor performance.

problem Designing a universal API for federated learning without public data.
method Proposed Federated Kernel ridge regression using knowledge distillation.
result Performance of new protocols closely matches theoretical predictions.

The study proves poor ideal three-edge triangulations are minimal for certain 3-manifolds.

problem Finding minimal ideal triangulations for specific 3-manifolds.
method Analyzing properties of poor ideal three-edge triangulations and applying them to construct minimal triangulations.
result Poor ideal three-edge triangulations are proven to be minimal for certain 3-manifolds.

Recent advances in deep reinforcement learning have achieved human-level performance on a variety of real-world applications. However, the current algorithms still suffer from poor gradient estimation with excessive variance, resulting in unstable training and poor sample efficiency. In our paper, we proposed an innova…

2019-05-20abs ↗pdf ↗

Framework improves ML performance by identifying high-quality data.

problem Poor data quality hampers ML performance.
method Intelligent data-centric evaluation framework combining quality measurements and unsupervised learning.
result Framework improves ML system performance in real-world use case.

Data on human spatial distribution and movement is essential for understanding and analyzing social systems. However existing sources for this data are lacking in various ways; difficult to access, biased, have poor geographical or temporal resolution, or are significantly delayed. In this paper, we describe how geoloc…

2016-06-20abs ↗pdf ↗

pFedGame uses game theory for decentralized federated learning in dynamic networks.

problem Performance bottlenecks, data bias, model convergence issues, and model poisoning attacks in federated learning.
method pFedGame employs game theory to decentralize federated learning, avoiding a central aggregation server and addressing dynamic network challenges.
result pFedGame achieves higher accuracy (over 70%) in heterogeneous data compared to existing methods.

The aim of this paper is to present a direct and simple proof of a result concerning the existence of metrics of positive Ricci curvature on the total space of fiber bundles with compact structure groups. In particular, it also generalizes and puts in a unified framework the results in Nash \cite{nash} and Poor \cite{p…

2019-11-09abs ↗pdf ↗

MFAI uses gradient boosted trees to leverage auxiliary info for scalable Bayesian matrix factorization.

problem Matrix factorization struggles with poor data quality, especially high sparsity and low SNR.
method Integrates gradient boosted trees into probabilistic matrix factorization framework.
result MFAI effectively leverages auxiliary information, improving model performance.

Study evaluates neural networks for corporate credit rating assessment.

problem Improving machine learning algorithms for credit assessment.
method Analysis of four neural network architectures (MLP, CNN, CNN2D, LSTM) on financial data from energy, financial, and healthcare sectors.
result LSTM architecture consistently outperforms others in predicting corporate credit ratings.

New insights into adversarial vulnerability linked to manifold separability issues.

problem Adversarial vulnerability in machine learning models.
method Characterized data distribution as a low-dimensional manifold, focusing on on/off manifold directions and the impact of first-order vs. second-order optimization methods.
result First-order optimization methods lead to poor convergence in the off-manifold direction, causing adversarial vulnerability in inseparable datasets.

Boosted decision trees typically yield good accuracy, precision, and ROC area. However, because the outputs from boosting are not well calibrated posterior probabilities, boosting yields poor squared error and cross-entropy. We empirically demonstrate why AdaBoost predicts distorted probabilities and examine three cali…

2012-07-04abs ↗pdf ↗

Gaussian Processes offer a flexible method for modeling and predicting outcomes with uncertainty estimates.

problem Capturing uncertainty in predictions at new data points, especially with poor overlap and extrapolation.
method Gaussian Processes model a posterior distribution over outcomes, reflecting the range of plausible models.
result GPs provide a principled approach to handling extrapolation and uncertainty in predictions.

Image captioning models are usually evaluated on their ability to describe a held-out set of images, not on their ability to generalize to unseen concepts. We study the problem of compositional generalization, which measures how well a model composes unseen combinations of concepts when describing images. State-of-the-…

2019-09-10abs ↗pdf ↗

Independent component analysis (ICA) is the most popular method for blind source separation (BSS) with a diverse set of applications, such as biomedical signal processing, video and image analysis, and communications. Maximum likelihood (ML), an optimal theoretical framework for ICA, requires knowledge of the true unde…

2016-10-22abs ↗pdf ↗

Sparse Blind Source Separation (sparse BSS) is a key method to analyze multichannel data in fields ranging from medical imaging to astrophysics. However, since it relies on seeking the solution of a non-convex penalized matrix factorization problem, its performances largely depend on the optimization strategy. In this …

2018-12-17abs ↗pdf ↗

Adversarial training has become one of the most effective methods for improving robustness of neural networks. However, it often suffers from poor generalization on both clean and perturbed data. In this paper, we propose a new algorithm, named Customized Adversarial Training (CAT), which adaptively customizes the pert…

2020-02-17abs ↗pdf ↗