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

Trend · papers per month

20406080 · Jun 202019922001200920172026
48 results for minimalist perspective

This paper provides a neural approach to represent option implied information.

problem Link between implied density and volatility for arbitrage-free modeling.
method Minimalist perspective on implied volatility, neural representation with arbitrage constraints.
result Shallow feedforward network with a single hidden layer effectively approximates implied density and volatility.

MINTS uses a minimalist Bayesian framework to tackle multi-armed bandits with structural constraints.

problem Sequential decision-making under uncertainty with complex structural constraints.
method Minimalist Bayesian framework with profile likelihood to eliminate nuisance parameters.
result MINTS achieves near-optimal regret guarantees and adapts to unimodal structure.

Minimalistic model captures head direction system properties.

problem Representing head direction system in a high-dimensional space.
method A minimalistic representation model of the rotation group U(1), including fully connected and convolutional versions.
result Emergence of Gaussian-like tuning profiles and 2D circle geometry in both model versions.

A minimalist approach generates synthetic tabular data with sparse PCA and XGBoost.

problem Generating robust synthetic tabular data for model testing.
method Minimalistic unsupervised SparsePCA encoder with XGBoost decoder.
result The method provides an alternative to raw and quantile perturbation for model robustness testing.

A minimalist approach improves LLM reasoning by filtering incorrect responses.

problem Improving large language model (LLM) reasoning on complex tasks.
method Revisit GRPO from a reinforce-like algorithm perspective, proposing Reinforce-Rej.
result RAFT, a simple rejection sampling baseline, outperforms GRPO and PPO.

A new Bayesian framework simplifies stochastic optimization by focusing on key parameters.

problem Bayesian methods struggle with complex structural constraints.
method Minimalist Bayesian framework that eliminates nuisance parameters via profile likelihood.
result Near-optimal regret guarantees for multi-armed bandits and convex optimization.

Minimalistic unsupervised learning with sparse manifold transform achieves SOTA performance.

problem Achieving state-of-the-art unsupervised learning performance without complex engineering.
method Sparse manifold transform, leveraging sparse coding, manifold learning, and slow feature analysis.
result 99.3% KNN top-1 accuracy on MNIST, 81.1% on CIFAR-10, and 53.2% on CIFAR-100.

We study a minimalist kinetic model for economies. A system of agents with local trading rules display emergent demand behaviour. We examine the resulting wealth distribution to look for non-thermal behaviour. We compare and contrast this model with other similar models.

2007-10-05abs ↗pdf ↗

GMC benchmark isolates retrieval in Transformers, revealing max-margin alignment.

problem Understanding how Transformers develop match-and-copy behavior on natural data.
method Introducing Gaussian Match-and-Copy (GMC) as a minimalist benchmark.
result Gradient descent drives parameters to diverge while aligning with max-margin separator.

MINIMALIST maximizes mutual information for likelihood estimation from simulated data.

problem Learning model parameters from likelihood functions that cannot be computed.
method Maximizes mutual information between simulated data and model parameters using neural networks.
result Different methods aiming at the same optimal energy form can be directly benchmarked.

Motion planning and control are key problems in a collection of robotic applications including the design of autonomous agile vehicles and of minimalist manipulators. These problems can be accurately formalized within the language of affine connections and of geometric control theory. In this paper we overview recent r…

2002-09-17abs ↗pdf ↗

Wealth inequality is an important matter for economic theory and policy. Ongoing debates have been discussing recent rise in wealth inequality in connection with recent development of active financial markets around the world. Existing literature on wealth distribution connects the origins of wealth inequality with a v…

2018-09-23abs ↗pdf ↗

We introduce and study a simple model of a limit order-driven market. Traders in this model can either trade at the market price or place a limit order, i.e. an instruction to buy (sell) a certain amount of the stock if its price falls below (raises above) a predefined level. The choice between these two options is pur…

1999-10-30abs ↗pdf ↗

You are a financial analyst. At the beginning of every week, you are able to rank every pair of stochastic processes starting from that week up to the horizon. Suppose that two processes are equal at the beginning of the week. Your ranking procedure is time consistent if the ranking does not change between this week an…

2017-11-23abs ↗pdf ↗

In this paper we propose a fusion approach to continuous emotion recognition that combines visual and auditory modalities in their representation spaces to predict the arousal and valence levels. The proposed approach employs a pre-trained convolution neural network and transfer learning to extract features from video …

2019-06-25abs ↗pdf ↗

A simple approach to offline RL without additional complexity.

problem Learning from a fixed dataset of actions with value estimation errors.
method Adding a behavior cloning term to the policy update of an online RL algorithm and normalizing the data.
result Matches the performance of state-of-the-art offline RL algorithms with minimal changes.

We consider the performance of the bootstrap in high-dimensions for the setting of linear regression, where p<np<n but p/np/n is not close to zero. We consider ordinary least-squares as well as robust regression methods and adopt a minimalist performance requirement: can the bootstrap give us good confidence intervals fo…

2016-08-02abs ↗pdf ↗

New method designs antimicrobial peptides with high potency and low toxicity.

problem Designing potent antimicrobial drugs with low toxicity.
method CLaSS method using deep generative autoencoder and atomistic simulations.
result Design and synthesis of two novel AMPs with high potency and low toxicity.

Machine learning models predict which ideas will be innovated based on subjective perspectives.

problem Predicting high-impact innovation based on subjective perspectives and interpersonal innovation opportunities.
method Quantifying subjective perspectives and their interaction based on innovator positions within a geometric space of concepts.
result Subjective perspectives predict which ideas individuals and groups will creatively attend to and successfully combine in the future.

A new approach for learning from expert demonstrations using multiple perspectives.

problem Learning from expert demonstrations with limited information from different perspectives.
method Generative adversarial network-based active learning approach.
result Our approach effectively learns from expert demonstrations and highlights the importance of architectural choices.

Smooth metric measure spaces have been studied from the two different perspectives of Bakry-Émery and Chang-Gursky-Yang, both of which are closely related to work of Perelman on the Ricci flow. These perspectives include a generalization of the Ricci curvature and the associated quasi-Einstein metrics, which include Ei…

2010-11-11abs ↗pdf ↗

In this paper, we perform a minimalistic quantization of the classical game of tic-tac-toe, by allowing superpositions of classical moves. In order for the quantum game to reduce properly to the classical game, we require legal quantum moves to be orthogonal to all previous moves. We also admit interference effects, by…

2010-07-21abs ↗pdf ↗

A new method interprets astrophysical spectra using geometric paths to distinguish line profiles.

problem Tackling the indistinguishability of spectral line profiles under scalar summaries.
method Introduces a geometric representation of line profiles using rough path theory, mapping profiles to a common velocity grid and defining descriptors from path properties.
result Compact descriptors separate morphologies with similar scalar summaries, revealing ordered line structures.

New MCMC method improves sampling efficiency across diverse structural models.

problem Low sampling efficiency in generic MCMC methods for specific problems.
method Adaptive Principal-Component (PC) Meta-learning Stochastic Gradient Hamiltonian Monte Carlo (APM-SGHMC) algorithm.
result Universal samplers achieve zero-shot generalization across structurally distinct models.

Currently, there starts a research trend to leverage neural architecture for recommendation systems. Though several deep recommender models are proposed, most methods are too simple to characterize users' complex preference. In this paper, for a fine-grain analysis, users' ratings are explained from multiple perspectiv…

2018-07-12abs ↗pdf ↗

This work analyzes tree-based methods from a ranking perspective, providing insights and new statistics.

problem Understanding the effectiveness of tree-based methods in finite-sample settings, especially symbolic feature selection.
method Local ranking perspective, finite-sample analysis, oracle bounds, posterior contraction results, concordant divergence statistics.
result New insights and statistics for evaluating symbolic feature mappings.

The present, partly expository, monograph consists of three parts. The first part treats Spin- and Pin-structures from three different perspectives and shows them to be suitably equivalent. It also introduces an intrinsic perspective on the relative Spin- and Pin-structures of Fukaya-Oh-Ohta-Ono and Solomon, establishe…

2019-05-27abs ↗pdf ↗

This paper analyzes self-supervised learning from a multi-view perspective.

problem Understanding and optimizing self-supervised learning from multi-view data.
method Information-theoretical framework to understand and design self-supervised learning objectives.
result Self-supervised representations can extract task-relevant information and discard task-irrelevant information.