More than 50 years ago Bongard introduced 100 visual concept learning problems as a testbed for intelligent vision systems. These problems are now known as Bongard problems. Although they are well known in the cognitive science and AI communities only moderate progress has been made towards building systems that can so…
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
48 results for “pragmatic reasoning”
Optimizes explanations for better listener understanding.
problem Insufficient consideration of listener preferences in concept-based explanations.
method Iterative training procedure based on direct preference optimization.
result Pragmatic explanations improve both model accuracy and user understanding.
Unsupervised machine learning helps design complex experiments more efficiently.
problem Designing experiments with many factors and constraints is challenging and costly.
method Applied a beta variational autoencoder (beta-VAE) to represent trials in a low-dimensional latent space.
result Generated pragmatic designs with fewer trials while maintaining objectives.
Pragmatic Information Rates, Generalizations of the Kelly Criterion, and Financial Market Efficiencycs.IT
This paper is part of an ongoing investigation of "pragmatic information", defined in Weinberger (2002) as "the amount of information actually used in making a decision". Because a study of information rates led to the Noiseless and Noisy Coding Theorems, two of the most important results of Shannon's theory, we begin …
Neural networks mimic algorithms to solve complex problems.
problem Current machine learning methods struggle with generalisation and efficiency.
method Representing algorithms in a continuous space and adapting them to real-world problems.
result Neural networks can execute classical algorithms more efficiently.
Case-based Explainability for Random Forest: Prototypes, Critics, Counter-factuals and Semi-factualscs.LG
New methods for explaining Random Forest predictions using case-based reasoning.
problem Lack of explainability for black-box machine learning models like Random Forests.
method Extracting distance metric from Random Forests to identify prototypes, critics, counter-factuals, and semi-factuals.
result Identified special points from training datasets to explain Random Forest predictions.
Pragmatic Curiosity: A Unified Framework for Hybrid Learning and Optimization via Active Inferencecs.LG
Unified framework for hybrid learning and optimization via active inference.
problem Sequential decisions in black-box evaluations requiring both task improvement and uncertainty reduction.
method Pragmatic Curiosity (PraC) framework that evaluates queries by balancing information gain and pragmatic value.
result Unified approach reduces decision risk and improves coverage of critical regions without task-specific rules.
A number of approaches to solving the well-known transfer pricing problem are known. However, few models satisfactorily resolve the core problem of allowing both the source and receiving divisions to earn a profit on transfers during a period in such a way that sub-optimal output levels are avoided. In 1969, Samuel pro…
The UCR Time Series Archive - introduced in 2002, has become an important resource in the time series data mining community, with at least one thousand published papers making use of at least one data set from the archive. The original incarnation of the archive had sixteen data sets but since that time, it has gone th…
Rehabilitation training is the primary intervention to improve motor recovery after stroke, but a tool to measure functional training does not currently exist. To bridge this gap, we previously developed an approach to classify functional movement primitives using wearable sensors and a machine learning (ML) algorithm.…
Machine Learning benefits from prior information and computational power for better performance and understanding.
problem Improper use of Machine Learning methods leads to lack of understanding and performance issues.
method Employing prior information and computational power to solve learning problems, emphasizing interpretability and performance.
result Combining prior information and computational power can lead to better understanding and performance in Machine Learning.
Companies increasingly expose machine learning (ML) models trained over sensitive user data to untrusted domains, such as end-user devices and wide-access model stores. We present Sage, a differentially private (DP) ML platform that bounds the cumulative leakage of training data through models. Sage builds upon the ric…
AIF reformulated as convex MDP for adaptive behavior.
problem Adaptive behavior and policy optimization.
method Formulating AIF as convex MDP, deriving mirror descent algorithm.
result EFE minimization in AIF is equivalent to reward maximization in latent MDP, with epistemic component.
We discuss several uses of blockchain (and, more generally, distributed ledger) technologies outside of cryptocurrencies with a pragmatic view. We mostly focus on three areas: the role of coin economies for what we refer to as data malls (specialized data marketplaces); data provenance (a historical record of data and …
We develop a general duality between neural networks and compositional kernels, striving towards a better understanding of deep learning. We show that initial representations generated by common random initializations are sufficiently rich to express all functions in the dual kernel space. Hence, though the training ob…
Relational data in its most basic form is a static collection of known facts. However, by learning to infer and deduct additional information and structure, we can massively increase the usefulness of the underlying data. One common form of inferential reasoning in knowledge bases is implication discovery. Here, by lea…
Path Integral and Asset Pricingq-fin.MF
We give a pragmatic/pedagogical discussion of using Euclidean path integral in asset pricing. We then illustrate the path integral approach on short-rate models. By understanding the change of path integral measure in the Vasicek/Hull-White model, we can apply the same techniques to "less-tractable" models such as the …
Modelling and simulation of dependence structures in nonlife insurance with Bernstein copulasstat.ME
The study models insurance dependence using Bernstein copulas.
problem Modeling dependence structures in nonlife insurance data.
method Review and suggest fitting Bernstein copulas to empirical data.
result Monte Carlo simulation and PML estimation for aggregate losses.
In the framework of Embedded Value new standards, namely the MCEV norms, the latest principles published in June 2008 address the issue of market and underwriting risks measurement by using stochastic models of projection and valorization. Knowing that stochastic models particularly data-consuming, the question which c…
This paper argues that the fundamental principle of contemporary financial economics is balanced reciprocity, not the principle of utility maximisation that is important in economics more generally. The argument is developed by analysing the mathematical Fundamental Theory of Asset Pricing with reference to the emergen…
This paper explores supervised techniques for continuous anomaly detection from biometric touch screen data. A capacitive sensor array used to mimic a touch screen as used to collect touch and swipe gestures from participants. The gestures are recorded over fixed segments of time, with position and force measured for e…
Causal discovery predicts unobserved joint statistics from observed data.
problem Inferring properties of unobserved joint distributions from observed data.
method Infer causal models from observed data to predict statistical properties of unobserved sets.
result Sparse causal graphs can be more useful than dense ones in predicting unobserved joint distributions.
This paper develops a Bayesian procedure for estimation and forecasting of the volatility of multivariate time series. The foundation of this work is the matrix-variate dynamic linear model, for the volatility of which we adopt a multiplicative stochastic evolution, using Wishart and singular multivariate beta distribu…
Analyzing multivariate time series data is important to predict future events and changes of complex systems in finance, manufacturing, and administrative decisions. The expressiveness power of Gaussian Process (GP) regression methods has been significantly improved by compositional covariance structures. In this paper…
The paper corrects biases in estimating intrinsic dimension and differential entropy.
problem Systematic bias in estimating intrinsic dimension and differential entropy.
method A bias-corrected estimator for both measures is proposed, highlighting shared steps and useful consequences.
result Simultaneous estimation of differential entropy and intrinsic dimension provides complementary perspectives on underlying manifolds.
Method constructs confidence regions for linear models with arbitrary predictors.
problem Constructing confidence regions for linear models with non-linear predictors.
method Mixed Integer Linear Programming for constraints.
result Empty confidence regions for hypothesis testing.
Deep learning frameworks have often focused on either usability or speed, but not both. PyTorch is a machine learning library that shows that these two goals are in fact compatible: it provides an imperative and Pythonic programming style that supports code as a model, makes debugging easy and is consistent with other …
High-speed detection of emergent market clustering via an unsupervised parallel genetic algorithmq-fin.CP
We implement a master-slave parallel genetic algorithm (PGA) with a bespoke log-likelihood fitness function to identify emergent clusters within price evolutions. We use graphics processing units (GPUs) to implement a PGA and visualise the results using disjoint minimal spanning trees (MSTs). We demonstrate that our GP…
This paper applies Heath-Jarrow-Morton framework to energy markets for practical use.
problem Applying complex financial models to energy markets for practical use.
method Calibration by PCA, Monte Carlo simulations, derivatives pricing.
result Calibrated model accurately simulates European power and gas markets.
We study probability measures induced by set functions with constraints. Such measures arise in a variety of real-world settings, where prior knowledge, resource limitations, or other pragmatic considerations impose constraints. We consider the task of rapidly sampling from such constrained measures, and develop fast M…
Study compares and unifies finiteness properties of locally compact groups.
problem Understanding finiteness properties of locally compact groups.
method Comparing and unifying three families of finiteness properties: type , coarse -connectedness, and type .
result All three families lead to the same notion for locally compact groups.
The ongoing concern about systemic risk since the outburst of the global financial crisis has highlighted the need for risk measures at the level of sets of interconnected financial components, such as portfolios, institutions or members of clearing houses. The two main issues in systemic risk measurement are the compu…
This paper tackles few-shot classification by improving GAN-based data augmentation.
problem Improving few-shot classification performance using GANs with limited data.
method Fine-tuning GANs for few-shot classification, addressing training and evaluation challenges.
result Semi-supervised fine-tuning is a more effective approach for few-shot classification with limited data.
We present an end-to-end statistical framework for personalized, accurate, and minimally invasive modeling of female reproductive hormonal patterns. Reconstructing and forecasting the evolution of hormonal dynamics is a challenging task, but a critical one to improve general understanding of the menstrual cycle and per…
Language Models are Hidden Reasoners: Unlocking Latent Reasoning Capabilities via Self-Rewardingcs.AI
LaTRO optimizes latent reasoning in LLMs without external reward.
problem Training LLMs to perform complex reasoning tasks.
method Formulates reasoning as latent distribution sampling and optimizes via variational approaches.
result LLMs improve reasoning and evaluation quality through self-improvement.
Auto-CEI improves LLM reasoning by balancing assertiveness and conservativeness.
problem Hallucinations and laziness in LLM reasoning tasks.
method Expert Iteration explores reasoning trajectories, guiding incorrect paths back on track and promoting appropriate 'I don't know' responses.
result Auto-CEI achieves superior alignment in logical reasoning, mathematics, and planning tasks.
A framework isolates VQA reasoning from perception for better model evaluation.
problem Improper separation of visual perception and reasoning in VQA models.
method Introducing a framework and a top-down calibration technique to decouple reasoning from perception.
result Improved evaluation of VQA models by separating reasoning from perception.
A new method for math reasoning that allows for iterative correction.
problem Standard reasoning models commit to each token and cannot recover from early errors.
method Generative framework with latent thought vectors for iterative self-correction.
result 30 rethinking iterations surpass baselines with 15 times more parameters.
Inferring new facts from existing knowledge graphs (KG) with explainable reasoning processes is a significant problem and has received much attention recently. However, few studies have focused on relation types unseen in the original KG, given only one or a few instances for training. To bridge this gap, we propose Co…
Transformers learn multi-step reasoning through gradient descent.
problem Understanding how transformers solve symbolic multi-step reasoning tasks.
method Theoretical analysis of gradient descent dynamics and multi-phase training.
result Trained one-layer transformers can solve both backward and forward reasoning tasks with generalization guarantees.
Transformers with CoT don't enhance reasoning power across all tasks.
problem Does CoT enhance the reasoning power of transformers?
method Examined the memorization capabilities of fixed-precision transformers with and without CoT.
result Transformers with CoT cannot memorize all reasoning tasks, leading to a negative answer.
Early stopping methods reduce unnecessary reasoning steps in LLMs by monitoring uncertainty signals.
problem LLMs sometimes generate unnecessary reasoning steps, especially under uncertainty.
method Statistically principled early stopping methods that monitor uncertainty signals during generation.
result Uncertainty-aware early stopping improves efficiency and reliability in LLM reasoning, especially in math reasoning.
Achieving artificial visual reasoning - the ability to answer image-related questions which require a multi-step, high-level process - is an important step towards artificial general intelligence. This multi-modal task requires learning a question-dependent, structured reasoning process over images from language. Stand…
FinTradeBench benchmarks LLMs for financial reasoning combining company fundamentals and market signals.
problem Challenges in evaluating financial reasoning models for LLMs.
method Developed a benchmark integrating company fundamentals and trading signals, using a calibration-then-scaling framework.
result Clear performance gap between LLMs, retrieval improves reasoning over textual fundamentals but not trading signals.
Hybrid framework injects TSLM insights into GRLM for robust time-series reasoning.
problem Lack of domain-specific knowledge in large language models for time-series reasoning.
method Hybrid knowledge-injection framework combining RLVR for efficient knowledge transfer.
result Consistently outperforms existing models by 7.9%-26.1% on multivariate time-series benchmarks.
The paper compares three option pricing models with varying volatility dynamics.
problem Comparing the accuracy and efficiency of different option pricing models with changing volatility.
method Used stochastic volatility models including Heston and MSV, and compared them with existing models on 15 index option datasets.
result Stochastic volatility models achieve comparable accuracy to existing models and are faster to calibrate.
Neural Logic Reasoning integrates deep learning and symbolic logic for better prediction tasks.
problem Lack of cognitive reasoning in deep neural networks limits their ability to solve complex prediction tasks.
method Proposes Logic-Integrated Neural Network (LINN) that learns logical operations and conducts propositional logical reasoning.
result LINN significantly outperforms state-of-the-art recommendation models in Top-K recommendation.
Forward-prediction models enhance physical reasoning, but only for specific tasks.
problem Improving physical reasoning in complex tasks involving many objects.
method Incorporated forward-prediction models into simple physical-reasoning agents and evaluated their performance on the PHYRE benchmark.
result Forward-prediction models improve physical-reasoning performance, especially on complex tasks, but generalization to new task templates is challenging.