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

19385675 · Jun 202019922001200920172026
48 results for case-based reasoning

A cased-based reasoning method predicts rare events on strategic sites using satellite imagery.

problem Manual prediction of rare events on strategic sites is impractical due to large datasets.
method Case-based reasoning approach incorporating expert knowledge for irregular time series and small datasets.
result The method significantly outperforms random selection on challenging applications.

Novel financial time-series data representation improves industry sector classification.

problem Classifying industries using historical stock returns time-series data.
method Proposed a novel representation based on stock returns embeddings for time-series data, overcoming representational challenges of conventional approaches.
result Substantial performance improvements over baselines using conventional representations.

A new explainable CBR system predicts financial risks with interpretability and good performance.

problem Predicting financial risks with interpretability and good performance.
method A novel explainable case-based reasoning (CBR) approach.
result The CBR system provides a good prediction performance and interpretability.

Paper develops a new similarity metric for predicting stock market returns.

problem Predicting stock returns is challenging due to market stochasticity and various influencing factors.
method Case-based reasoning approach using historical pricing data and a novel similarity metric.
result Demonstrates the benefits of the novel similarity metric in predicting stock market returns.

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.

In recent years, huge amounts of unstructured textual data on the Internet are a big difficulty for AI algorithms to provide the best recommendations for users and their search queries. Since the Internet became widespread, a lot of research has been done in the field of Natural Language Processing (NLP) and machine le…

2019-11-01abs ↗pdf ↗

Introduction. Case Based Reasoning (CBR) is an emerg- ing decision making paradigm in medical research where new cases are solved relying on previously solved similar cases. Usually, a database of solved cases is provided, and every case is described through a set of attributes (inputs) and a label (output). Extracting…

2013-03-07abs ↗pdf ↗

Doctors often rely on their past experience in order to diagnose patients. For a doctor with enough experience, almost every patient would have similarities to key cases seen in the past, and each new patient could be viewed as a mixture of these key past cases. Because doctors often tend to reason this way, an efficie…

2018-09-10abs ↗pdf ↗

ALPODS AI diagnoses high-dimensional biomedical data with human-understandable explanations.

problem AI decisions in high-dimensional biomedical data are not explainable to humans.
method ALPODS method classifies data based on clusters and generates fuzzy reasoning rules.
result ALPODS provides understandable explanations for AI diagnoses.

CBNNs model survival with time-varying interactions, outperforming other methods.

problem Complex covariate effects and time-varying interactions in survival analysis.
method Combines case-base sampling with neural networks to model time-varying effects and complex baseline hazards.
result CBNNs outperform regression and neural network-based survival methods in simulations and real data applications.

Statistical tests for fairness in admissions data reveal hidden patterns.

problem Simpson's paradox in admissions data hides true gender bias.
method Introduces a new statistical test based on Pearl's instrumental-variable inequalities.
result Statistical tests for fairness coincide with causal notions for the Berkeley admissions case.

For an affine two factor model, we study the asymptotic properties of the maximum likelihood and least squares estimators of some appearing parameters in the so-called subcritical (ergodic) case based on continuous time observations. We prove strong consistency and asymptotic normality of the estimators in question.

2013-02-14abs ↗pdf ↗

Survey on principles and challenges of interpretable machine learning.

problem Improving machine learning models' interpretability for high-stakes decisions.
method Identification and analysis of 10 technical challenges in interpretable machine learning.
result Identification of 10 technical challenges in interpretable machine learning.

Topological quantum computation with Fibonacci anyons relies on the possibility of efficiently generating unitary transformations upon pseudoparticles braiding. The crucial fact that such set of braids has a dense image in the unitary operations space is well known; in addition, the Solovay-Kitaev algorithm allows to a…

2008-01-18abs ↗pdf ↗

One of the major challenges in machine learning nowadays is to provide predictions with not only high accuracy but also user-friendly explanations. Although in recent years we have witnessed increasingly popular use of deep neural networks for sequence modeling, it is still challenging to explain the rationales behind …

2019-07-23abs ↗pdf ↗

Defining similarity measures is a requirement for some machine learning methods. One such method is case-based reasoning (CBR) where the similarity measure is used to retrieve the stored case or set of cases most similar to the query case. Describing a similarity measure analytically is challenging, even for domain exp…

2020-01-15abs ↗pdf ↗

In Statistical Learning, the Vapnik-Chervonenkis (VC) dimension is an important combinatorial property of classifiers. To our knowledge, no theoretical results yet exist for the VC dimension of edited nearest-neighbour (1NN) classifiers with reference set of fixed size. Related theoretical results are scattered in the …

2019-02-07abs ↗pdf ↗

Generative Adversarial Network (GAN) is a current focal point of research. The body of knowledge is fragmented, leading to a trial-error method while selecting an appropriate GAN for a given scenario. We provide a comprehensive summary of the evolution of GANs starting from its inception addressing issues like mode col…

2020-02-20abs ↗pdf ↗

Study ηη-Einstein Sasakian structures on Lie algebras, dividing cases based on center dimension.

problem Investigate ηη-Einstein Sasakian structures on Lie algebras.
method Divide cases based on center dimension, use theory of normal jj-algebras and modifications of Hermitian Lie algebras to construct examples.
result Construct new examples of ηη-Einstein Sasakian Lie algebras and solvmanifolds.

Unified framework for Bayes-optimal classifiers under group fairness.

problem Mitigating disparate impacts from algorithmic predictions in high-stakes decision-making.
method Unified framework based on Neyman-Pearson argument for deriving Bayes-optimal classifiers under group fairness constraints.
result Proposes FairBayes method that directly controls disparity and achieves optimal fairness-accuracy tradeoff.

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 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.

This paper optimizes Bayesian estimation for log-concave models using Langevin Monte-Carlo.

problem Optimizing Bayesian estimators for log-concave models with Langevin Monte-Carlo.
method Quantitative statistical bounds and numerical approximation of Gibbs measures.
result Established optimal numerical strategy and its cost for Bayesian posterior mean approximation.

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…

2019-06-13abs ↗pdf ↗

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.

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…

2017-07-10abs ↗pdf ↗

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.

Study Heisenberg homology on surface configurations, revealing new representations of mapping class groups.

problem Homology of surface configurations with Heisenberg group representations.
method Analysis of unordered configurations in a surface, using Heisenberg group actions and representations.
result Obtained genuine and projective representations of mapping class groups from Heisenberg group actions.