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

Trend · papers per month

191383574765 · Jun 202019922001200920172026
48 results for stateful premise selection

New method selects facts in proofs using stateful recurrent neural networks.

problem Selecting facts for proving new goals over large formal libraries.
method Stateful architecture based on recurrent neural networks with data augmentation.
result Significantly better performance and solving many new problems compared to previous methods.

LeanDojo removes barriers to theorem proving with open-source tools and data.

problem Difficulty in reproducing and building on existing theorem proving methods.
method Introduces LeanDojo, an open-source Lean playground with toolkits, data, models, and benchmarks.
result ReProver, an LLM-based prover augmented with retrieval, outperforms non-retrieval baselines and GPT-4.

In this paper, we demonstrate how to do automated theorem proving in the presence of a large knowledge base of potential premises without learning from human proofs. We suggest an exploration mechanism that mixes in additional premises selected by a tf-idf (term frequency-inverse document frequency) based lookup in a d…

2019-05-25abs ↗pdf ↗

Ogburn et al. (2019, arXiv:1910.05438) discuss "The Blessings of Multiple Causes" (Wang and Blei, 2018, arXiv:1805.06826). Many of their remarks are interesting. But they also claim that the paper has "foundational errors" and that its "premise is...incorrect." These claims are not substantiated. There are no foundatio…

2019-10-15abs ↗pdf ↗

REALFIN benchmarks financial reasoning by removing implicit assumptions, revealing model weaknesses.

problem Models struggle when implicit assumptions are missing, leading to incorrect answers.
method Developed a bilingual benchmark that systematically removes essential premises from financial questions.
result General-purpose models over-commit, while finance-specialized models fail to identify missing premises.

The study examines how language models learn to represent the world, identifying conditions for ecological veridicality.

problem Understanding when language models learn to represent the world accurately and how this learning process can fail.
method Analyzes the Bayes-optimal next-token cross-entropy decomposition and the role of training ecology in shaping model representations.
result The minimum-complexity zero-excess solution is the quotient partition by training equivalence, and this solution is not preserved in in-context learning or per-task adaptation.

Semi-supervised learning improves classification in high dimensions.

problem Combining labeled and unlabeled data for high-dimensional classification.
method Information theoretic and computational lower bounds analysis for feature selection.
result Semi-supervised learning is advantageous for classification in high dimensions.

PSC classifier improves HDLSS classification on class-imbalanced data.

problem Classification on high-dimension low-sample-size data with class imbalance.
method Population Structure-learned Classifier (PSC) maximizing inter-class and intra-class scatter matrices.
result PSC outperforms state-of-the-art methods on IHDLSS.

Any surface can be foliated into equipotential hypersurfaces of the level sets. A current result is that the contours are the progressing wave fronts of a certain hyperbolic partial differential equation, a wave equation. It is connected with the gradient lines, as well as with a corresponding eikonal equation. The lev…

2013-09-12abs ↗pdf ↗

New method improves bivariate causal discovery by accurately estimating cause variable complexity.

problem Improper estimation of cause variable complexity in current MDL-based methods.
method Rate-distortion MDL (RDMDL) using information dimension for cause variable complexity estimation.
result RDMDL achieves competitive performance on Tübingen dataset.

SPECTRA improves probabilistic energy forecasting by separating trends and uncertainties.

problem Interacting uncertainties from renewable intermittency, demand flexibility, market volatility, and weather impact probabilistic forecasts.
method Adaptive state-space exogenous context and temporal-frequency resolution architecture.
result Achieved best CRPS in 14 out of 18 settings, reducing CRPS by 5.74% and upper-tail quantile risk by 7.27%.

The isotropic correlation model explains equity returns better than linear factor models.

problem Understanding the covariance structure of equity returns.
method Developed an isotropic covariance model for equity returns, analyzed empirical data, and compared results to linear factor models.
result The isotropic covariance model provides a better fit to recent equity return data compared to linear factor models.

Much recent machine learning research has been directed towards leveraging shared statistics among labels, instances and data views, commonly referred to as multi-label, multi-instance and multi-view learning. The underlying premises are that there exist correlations among input parts and among output targets, and the …

2017-02-22abs ↗pdf ↗

This paper tackles belief-state selection in simulators with latent states.

problem Selecting among approximate belief-state samplers for simulators with latent variables.
method Reduces belief-state selection to conditional distribution selection, develops algorithms and analyses.
result Different formulations of belief-state selection have varying guarantees under different roll-out methods.

Recently generative models have focused on combining the advantages of variational autoencoders (VAE) and generative adversarial networks (GAN) for good reconstruction and generative abilities. In this work we introduce a novel hybrid architecture, Implicit Discriminator in Variational Autoencoder (IDVAE), that combine…

2019-09-28abs ↗pdf ↗

Ensemble learning is a statistical paradigm built on the premise that many weak learners can perform exceptionally well when deployed collectively. The BART method of Chipman et al. (2010) is a prominent example of Bayesian ensemble learning, where each learner is a tree. Due to its impressive performance, BART has rec…

2018-10-01abs ↗pdf ↗

Study stability of selective SSMs with discontinuous gating.

problem Challenges in stability analysis of selective SSMs with discontinuous gating.
method Passivity and Input-to-State Stability (ISS) analysis of continuous-time selective SSMs.
result Derivation of sufficient conditions for global ISS with respect to the port input.

Selective state-adaptive regularization improves offline RL performance.

problem Extrapolation errors and value overestimation in static dataset RL.
method State-adaptive regularization coefficients trust Bellman-driven results selectively.
result Significant improvement in performance on D4RL benchmark.

SEEK algorithm selects minimal state in reinforcement learning for better policy learning.

problem Challenges in obtaining a state representation that is parsimonious and satisfies the Markov property.
method SEEK algorithm estimates the minimal sufficient state in reinforcement learning.
result The SEEK algorithm achieves selection consistency in large samples.

We propose a nonparametric procedure to achieve fast inference in generative graphical models when the number of latent states is very large. The approach is based on iterative latent variable preselection, where we alternate between learning a 'selection function' to reveal the relevant latent variables, and use this …

2014-12-10abs ↗pdf ↗

It is known that the impact of transactions on stock price (market impact) is a concave function of the size of the order, but there exists little quantitative theory that suggests why this is so. I develop a quantitative theory for the market impact of hidden orders (orders that reflect the true intention of buying an…

2008-04-24abs ↗pdf ↗

FedCM measures contributions in real-time for federated learning.

problem Fairly allocating contributions in federated learning systems.
method FedCM calculates impact based on current and previous rounds with attention aggregation.
result FedCM is more sensitive to data quality and quantity in real-time.

This paper uses Reinforcement Learning to select features from a large dataset.

problem Selecting the best features to minimize variance and bias in machine learning models.
method Formulated the feature selection problem as a Markov Decision Process (MDP) and used Temporal Difference (TD) algorithm.
result The approach using Reinforcement Learning outperformed other methods in selecting features.

Study uses FDA to analyze discount functions of different temperaments.

problem Traditional finance models fail to capture individual differences in investment choices.
method Functional Data Analysis (FDA) to investigate temporal discounting behaviors.
result Heterogeneity within each temperament revealed, suggesting diverse investor profiles.

New Convolutional Unit improves Batch Whitening performance.

problem Improving the efficiency and effectiveness of Batch Whitening.
method Proposes a new Convolutional Unit that aligns with Batch Whitening theory and empirically analyzes the original Convolutional Unit.
result Significantly improved performance on multiple image classification datasets.

Whereas most dimensionality reduction techniques (e.g. PCA, ICA, NMF) for multivariate data essentially rely on linear algebra to a certain extent, summarizing ranking data, viewed as realizations of a random permutation ΣΣ on a set of items indexed by i{1,,  n}i\in \{1,\ldots,\; n\}, is a great statistical challenge, due to…

2018-10-15abs ↗pdf ↗

Automatic understanding of human affect using visual signals is a problem that has attracted significant interest over the past 20 years. However, human emotional states are quite complex. To appraise such states displayed in real-world settings, we need expressive emotional descriptors that are capable of capturing an…

2018-11-11abs ↗pdf ↗

Sparse Kernel Flows learns dynamical systems from data.

problem Learning dynamical systems from limited data.
method Sparse Kernel Flows: trains optimal kernel from a dictionary of kernels.
result Sparse Kernel Flows can learn from 132 chaotic systems.

A residual network (or ResNet) is a standard deep neural net architecture, with state-of-the-art performance across numerous applications. The main premise of ResNets is that they allow the training of each layer to focus on fitting just the residual of the previous layer's output and the target output. Thus, we should…

2018-04-18abs ↗pdf ↗

Improves algorithm selection for thousands of candidates using dyadic features.

problem Selecting the best algorithm from a large set of candidates for specific problems.
method Proposes extreme algorithm selection (XAS) with dyadic feature representation.
result Improves significantly over current state of the art in various metrics.

Unified statistical framework for LSTM model selection.

problem Model selection and hyperparameter tuning in LSTM networks is heuristic and computationally expensive.
method Proposes a statistical framework extending classical model selection ideas to LSTM networks.
result Improved performance of the proposed framework demonstrated on biomedical data.