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

2915828731,164 · Jun 202019922001200920172026
48 results for performance limits

Method estimates model performance on external samples from limited statistical characteristics.

problem Limited access to multiple datasets due to privacy and commercial restrictions.
method Search for weights that match external statistics and are closest to uniform, using model performance on weighted internal sample as an estimation.
result Estimated external performance is closer to actual performance than internal performance.

A new method combines simple binary classifiers to build complex multiclass classifiers, achieving performance limits in a Gaussian setting.

problem Building a sophisticated multiclass classifier from simple binary decisions.
method Combining O(logK)O(\log K) simple binary classifiers to form a KK-class classifier.
result Explicit performance bounds across various decoding and dimensional regimes for a stylized Gaussian setting.

Study integrates deep learning with financial data for improved trading strategies.

problem Enhancing predictive performance in algorithmic trading and portfolio optimization.
method Developed embedding techniques to treat limit order book snapshots as image-based input channels.
result Achieved state-of-the-art performance in high-frequency trading algorithms.

Study limits of testing algorithms without assumptions, finding key performance bounds.

problem Understanding algorithm performance without making assumptions.
method Exploring fundamental limits of algorithm performance testing.
result Hardness results for evaluating algorithm performance and comparing multiple algorithms.

Infinite CNNs lose spatial correlations, but can be restored by correlated weights.

problem Infinite CNNs lose spatial correlations, which are crucial for their performance.
method Introduced correlated weights to restore spatial correlations in infinite CNNs.
result Optimal performance is achieved with a moderate level of weight correlation.

Embedded ensembles improve neural network performance efficiently.

problem Improving neural network performance with fewer resources.
method Analyzing the wide network limit of gradient descent dynamics using Neural-Tangent-Kernel.
result Embedded ensembles exhibit two regimes: independent and collective, affecting performance.

Online Active Learning (OAL) aims to manage unlabeled datastream by selectively querying the label of data. OAL is applicable to many real-world problems, such as anomaly detection in health-care and finance. In these problems, there are two key challenges: the query budget is often limited; the ratio between classes i…

2019-11-18abs ↗pdf ↗

Processing temporal sequences is central to a variety of applications in health care, and in particular multi-channel Electrocardiogram (ECG) is a highly prevalent diagnostic modality that relies on robust sequence modeling. While Recurrent Neural Networks (RNNs) have led to significant advances in automated diagnosis …

2018-02-18abs ↗pdf ↗

DAEDL improves EDL's OOD detection and classification performance by integrating feature space density.

problem Limited OOD detection and classification performance of EDL.
method Integrates feature space density with EDL's output and uses a novel parameterization.
result Demonstrates state-of-the-art performance across uncertainty estimation and classification tasks.

This paper investigates compression techniques for deep neural networks to reduce their size without sacrificing performance.

problem Compression of large deep neural networks for resource-limited platforms.
method Weight pruning, quantization, and lossless weight matrix representations based on source coding.
result Achieved up to 165 times compression rate while maintaining or improving model performance.

Machine learning classification limits estimated using Kullback-Leibler divergence and Cohen's Kappa.

problem Estimating the best possible performance of machine learning classification algorithms.
method Relating Kullback-Leibler divergence to Cohen's Kappa and using the Chernoff-Stein Lemma to estimate error rates.
result Classification algorithms could not have performed any better due to underlying probability density functions for the two classes.

Paper tackles offline RL with limited target samples using domain adaptation.

problem Limited samples in target dataset degrade offline RL performance.
method Proposes a framework to balance target and source datasets with theoretical guarantees.
result Establishes performance bounds and optimal weight for offline RL.

Study compares Islamic banks' accounting and market performance.

problem Assessing the relationship between Islamic banks' accounting and market performance.
method Selected six Islamic banks, collected data from 2009-2013, used random-effect models.
result Superior accounting performance does not correlate with superior market performance.

RL agent learns to place limit orders for trading signals in financial markets.

problem Training an RL agent to execute trading signals in limit order book markets.
method Deep Duelling Double Q-learning with APEX architecture, using synthetic alpha signals.
result RL agent outperforms heuristic trading strategies in inventory management and order placing.

Deep learning methods are becoming widely used for restoration of defects associated with fluorescence microscopy imaging. One of the major challenges in application of such methods is the availability of training data. In this work, we propose a unified method for reconstruction of multi-defect fluorescence microscopy…

2019-10-31abs ↗pdf ↗

Note that this paper is superceded by "Black-Box Adversarial Attacks with Limited Queries and Information." Current neural network-based image classifiers are susceptible to adversarial examples, even in the black-box setting, where the attacker is limited to query access without access to gradients. Previous methods -…

2017-12-19abs ↗pdf ↗

Neural causal discovery methods fail to accurately uncover causal structures due to the faithfulness property.

problem Accuracy in neural causal discovery is limited, especially when distinguishing between existing and non-existing causal relationships.
method Systematic evaluation of neural causal discovery methods, focusing on their performance in finite sample regimes and their ability to recover ground-truth graphs.
result Neural networks lack the precision to reliably recover ground-truth causal graphs, even for small graphs and large sample sizes.

Kernelized Support Vector Machines (SVMs) are among the best performing supervised learning methods. But for optimal predictive performance, time-consuming parameter tuning is crucial, which impedes application. To tackle this problem, the classic model selection procedure based on grid-search and cross-validation was …

2016-02-10abs ↗pdf ↗

We propose a parametric model for the simulation of limit order books. We assume that limit orders, market orders and cancellations are submitted according to point processes with state-dependent intensities. We propose new functional forms for these intensities, as well as new models for the placement of limit orders …

2016-02-12abs ↗pdf ↗

Algorithm optimizes and infers performance online, improving reliability.

problem Balancing optimization and statistical inference in complex systems.
method Online algorithm that provides consistent performance variance and confidence intervals.
result Online consistent estimator for performance variance and asymptotic confidence intervals.

Deep learning models struggle with new data in stock price trend prediction.

problem Stock price trend prediction using Deep Learning models.
method Examination of fifteen state-of-the-art DL models on LOB data, using LOBCAST framework.
result All models show significant performance drop with new data, questioning their market applicability.

Bayes-optimal limits in PCA with structured noise are determined.

problem Analyzing statistical dependencies in measurement noise for high-dimensional inference.
method Study of spiked matrix model with low-order polynomial orthogonal noise, providing Bayes-optimal limits and proposing a novel AMP.
result A novel AMP algorithm reaches the information-theoretic limits for more general priors.

A quasi-centralized limit order book (QCLOB) is a limit order book (LOB) in which financial institutions can only access the trading opportunities offered by counterparties with whom they possess sufficient bilateral credit. We perform an empirical analysis of a recent, high-quality data set from a large electronic tra…

2015-02-02abs ↗pdf ↗

New research shows label refinement and weak training have limitations for aligning LLMs.

problem Limitations of refinement methods for aligning large language models.
method Analyzed probabilistic assumptions and alternative approaches to label refinement and weak training.
result Label refinement and weak training suffer from irreducible error, leaving a performance gap.

Sumformer simplifies Transformers to handle long sequences efficiently.

problem Quadratic complexity of Transformers limits their use with long sequences.
method Introducing Sumformer, a simple architecture that universally approximates equivariant sequence-to-sequence functions.
result Sumformer achieves the first universal approximation results for Linformer and Performer.

In network embedding, random walks play a fundamental role in preserving network structures. However, random walk based embedding methods have two limitations. First, random walk methods are fragile when the sampling frequency or the number of node sequences changes. Second, in disequilibrium networks such as highly bi…

2018-05-09abs ↗pdf ↗

The goal behind Domain Adaptation (DA) is to leverage the labeled examples from a source domain so as to infer an accurate model in a target domain where labels are not available or in scarce at the best. A state-of-the-art approach for the DA is due to (Ganin et al. 2016), known as DANN, where they attempt to induce a…

2018-09-20abs ↗pdf ↗

New algorithm optimizes tessellated kernels for larger datasets and improved performance.

problem Limited accuracy and complexity in machine learning algorithms based on kernel optimization.
method 2-step algorithm for optimizing tessellated kernels, scaling to 10,000 data points and extending to regression.
result Significant improvement in performance over Neural Nets and SimpleMKL with similar computation time.

We propose a new class of mappings, called Dynamic Limit Growth Indices, that are designed to measure the long-run performance of a financial portfolio in discrete time setup. We study various important properties for this new class of measures, and in particular, we provide necessary and sufficient condition for a Dyn…

2013-12-04abs ↗pdf ↗