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

224449673897 · Jun 202019922001200920172026
48 results for modern approach

Surveying topological complexity of graph configurations, unifying traditional and modern approaches.

problem Understanding the topological complexity of configuration spaces of graphs.
method Exploring traditional cohomology methods and modern asphericity/fundamental group approaches.
result Unified understanding of topological complexity through both traditional and modern methods.

Classical approaches for approximate inference depend on cleverly designed variational distributions and bounds. Modern approaches employ amortized variational inference, which uses a neural network to approximate any posterior without leveraging the structures of the generative models. In this paper, we propose Amorti…

2019-06-06abs ↗pdf ↗

The ever-increasing size of modern data sets combined with the difficulty of obtaining label information has made semi-supervised learning one of the problems of significant practical importance in modern data analysis. We revisit the approach to semi-supervised learning with generative models and develop new models th…

2014-06-20abs ↗pdf ↗

Improved functional data modeling with modern imputation methods.

problem Estimating complex non-linear models with sparsely and irregularly sampled functional data.
method Modified multiple imputation methods combining MissForest and Local Linear Forest.
result New imputation methods produce better estimates than existing methods.

The paper addresses optimal control in modern tontines with bequest preferences, showing a linear investment strategy.

problem Optimal controls and decreasing allocation in modern tontines with bequest preferences.
method Dual approach to solve optimal control problems with power utilities, modeling bequest preferences.
result Investment strategy almost linearly adjusts from 0% to 100% over time.

The paper proposes modern computational methods for optimizing reinsurance contracts.

problem Optimizing catastrophe excess-of-loss reinsurance contracts with realistic constraints and risk measures.
method Two approaches: simulated annealing for local search and quantum branch & bound for future potential.
result Quantum branch & bound approach shows potential for future optimization with quantum computers.

Hopfield networks outperform deep-learning methods in portfolio optimization.

problem Optimizing portfolios and managing asset allocation efficiently.
method Application of Hopfield networks to portfolio optimization, using combinatorial purged cross-validation.
result Modern Hopfield Networks perform on par or better than deep-learning methods, with faster training times and better stability.

Unified framework for arbitrary conditional inference using AI and Bayesian methods.

problem Limited flexibility in existing conditional inference methods.
method Bayesian generative modeling with stochastic iterative algorithm.
result Single learned model for universal conditional prediction with uncertainty quantification.

TabSurv adapts tabular neural networks for survival analysis.

problem Survival analysis on tabular data using deep learning methods.
method Adapts modern tabular architectures to survival analysis using Weibull distribution or non-parametric prediction. Optimizes SurvHL histogram loss function.
result TabSurv consistently outperforms classical and deep learning baselines on 10 real-world survival datasets.

Despite rapid advances in machine learning tools, the majority of neural decoding approaches still use traditional methods. Modern machine learning tools, which are versatile and easy to use, have the potential to significantly improve decoding performance. This tutorial describes how to effectively apply these algorit…

2017-08-02abs ↗pdf ↗

Blackwell's theorems influence modern AI through information compression and decision making.

problem Information compression and decision making under uncertainty.
method Theorems developed in the 1940s and 1950s, applied to modern AI.
result Blackwell theorems remain relevant and influence modern AI subfields.

In this work we present a review of the state of the art of Learning Vector Quantization (LVQ) classifiers. A taxonomy is proposed which integrates the most relevant LVQ approaches to date. The main concepts associated with modern LVQ approaches are defined. A comparison is made among eleven LVQ classifiers using one r…

2015-09-23abs ↗pdf ↗

Differentiable programming aids in solving differential equations and their sensitivities.

problem Computing gradients of numerical solutions of differential equations.
method Review of existing techniques and mathematical foundations.
result Established a coherent framework for combining differential equations with data-driven approaches.

Modern neural networks tend to be overconfident on unseen, noisy or incorrectly labelled data and do not produce meaningful uncertainty measures. Bayesian deep learning aims to address this shortcoming with variational approximations (such as Bayes by Backprop or Multiplicative Normalising Flows). However, current appr…

2017-11-03abs ↗pdf ↗

We analyse the effectiveness of modern deep learning techniques in predicting credit ratings over a universe of thousands of global corporate entities obligations when compared to most popular, traditional machine-learning approaches such as linear models and tree-based classifiers. Our results show a adequate accuracy…

2019-12-20abs ↗pdf ↗

Unified framework for non-linear attention using modern Hopfield networks.

problem Improving transformer model's understanding of complex relationships and efficiency.
method Proposes an energy functional based on Modern Hopfield Networks (MNH) to unify linear and non-linear attention mechanisms.
result Context wells encapsulate contextual relationships among tokens, offering a richer representation of non-linear data.

This paper deals with the numerical approximation of American-style option values governed by partial differential complementarity problems. For a variety of one- and two-asset American options we investigate by ample numerical experiments the temporal convergence behaviour of three modern splitting methods: the explic…

2016-10-30abs ↗pdf ↗

BiSHop tackles tabular data challenges with sparse Hopfield layers.

problem Non-rotationally invariant data structure and feature sparsity in tabular data.
method Sequential column-wise and row-wise processing through interconnected directional learning modules with generalized sparse modern Hopfield layers.
result BiSHop surpasses current SOTA methods with significantly less hyperparameter tuning.

We analyze computational limits of modern Hopfield models based on pattern norms.

problem Understanding the efficiency of modern Hopfield models from a fine-grained complexity perspective.
method Fine-grained complexity analysis and upper bound criterion for pattern norms.
result Below a specific norm threshold, efficient variants of modern Hopfield models exist.

Hopfield networks improve reaction template prediction for few/zero-shot scenarios.

problem Predicting reaction templates for new molecules in CASP.
method Adapted Hopfield networks to associate reaction templates, molecules, and structural information.
result Significantly improved performance for templates with few or zero training examples.

Bayesian approach scores influential training examples for model predictions.

problem Enhance interpretability and safety of machine learning models.
method Formulate TDA as a Bayesian information-theoretic problem, scoring subsets by information loss.
result Method aligns with classical influence scores while promoting diversity for subsets.

How useful can machine learning be in a quantum laboratory? Here we raise the question of the potential of intelligent machines in the context of scientific research. A major motivation for the present work is the unknown reachability of various entanglement classes in quantum experiments. We investigate this question …

2017-06-02abs ↗pdf ↗

A database of objects discovered in houses in the Roman city of Pompeii provides a unique view of ordinary life in an ancient city. Experts have used this collection to study the structure of Roman households, exploring the distribution and variability of tasks in architectural spaces, but such approaches are necessari…

2012-02-14abs ↗pdf ↗

Modern health data science applications leverage abundant molecular and electronic health data, providing opportunities for machine learning to build statistical models to support clinical practice. Time-to-event analysis, also called survival analysis, stands as one of the most representative examples of such statisti…

2018-04-09abs ↗pdf ↗

FF layers in transformers are nearly as interpretable as sparse autoencoders.

problem Comparing interpretability of feature vectors in FF layers vs. sparse autoencoders.
method Revisited interpretability of FF layers as key-value memories using modern benchmarks.
result FF and SAE feature vectors are similarly interpretable, but FFs can be better in some aspects.

New scaling laws optimize model size, training, and inference for better performance.

problem Trade-off between model size and inference cost in modern LLMs.
method Train-to-Test (T2T^2) scaling laws that jointly optimize model size, training tokens, and inference samples.
result Optimal pretraining decisions shift into overtraining regime, leading to stronger performance.