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

4590135180 · Jun 202019922001200920172026
48 results for data-driven insights

Bayesian nonparametrics improves data-driven risk optimization under distributional uncertainty.

problem Improving out-of-sample performance in machine learning models due to distributional uncertainty.
method Combining Bayesian nonparametric theory and decision-theoretic preferences to propose a robust optimization criterion.
result The proposed robust optimization procedure provides favorable statistical guarantees and tractable approximations.

We consider deep feedforward neural networks with rectified linear units from a signal processing perspective. In this view, such representations mark the transition from using a single (data-driven) linear representation to utilizing a large collection of affine linear representations tailored to particular regions of…

2019-03-29abs ↗pdf ↗

Study clusters Kenyan medical insurance companies based on financial performance and reporting consistency.

problem Identifying financial health and reporting consistency in Kenyan medical insurance companies.
method Advanced clustering techniques (KMeans, DTW) on financial ratios and time series data.
result Four distinct clusters identified, each representing different financial performance and reporting consistency combinations.

A heuristic minimizes tardy jobs' total weight on single-machine scheduling.

problem Minimizing tardy jobs' total weight on single-machine scheduling.
method Data-driven heuristic combining machine learning and problem-specific characteristics.
result Significantly outperforms state-of-the-art in optimality gap and adaptability.

Study reveals hidden infections and infection dynamics from early data.

problem Understanding early infection dynamics and hidden infections in COVID-19.
method Data-driven machine learning analysis focusing on infection counts over time.
result Significant asymptomatic infections, 10-day lag, and strong infectious force.

New insights into bias-variance tradeoff for data-driven optimization under local misspecification.

problem Understanding the relative performance of SAA, IEO, and ETO under local misspecification.
method Developed a local misspecification perspective using contiguity theory in statistics.
result Explicit expressions for decision bias and geometric understanding of variance.

Pipeline learns topological features for protein stability prediction.

problem Predicting protein stability using topological features.
method Data-driven method to learn topological features, comparing with expert features.
result Topological features achieve 92%-99% of SME-based models' performance.

HAD-Net forecasts glucose levels with insights into insulin and carbs diffusion.

problem Inaccurate predictions in glucose level forecasting without context understanding.
method Hybrid model combining deep learning and physiological models, using recurrent attention network.
result Achieves competitive performance in glucose level forecasting with plausible diffusion insights.

Study assesses data-driven and physics-based SGS models for transcritical combustion.

problem Challenges in simulating high-pressure combustion systems due to complex fluid behaviors.
method Comparison of physics-based and random forest machine learning models in turbulent transcritical non-premixed flames.
result Random forest models can effectively model subgrid stresses, providing insight into their formation.

MaxEnt framework recovers standard model selection procedures and identifies the most generalizable model.

problem Model selection and characterization in data-scientific approaches.
method Starting from linear system of phenomenological constraints, asymptotically derive the distribution over all viable distributions.
result MaxEnt distribution is the most typical among all viable distributions and supports hypothesis testing in a fully-data driven manner.

DAUM networks improve weather forecasting with attention and multistream features.

problem Improving weather forecasting accuracy using deep learning.
method Proposes DAUM networks combining tensorial unistream and multistream representations with attention mechanisms.
result Adding self-attention blocks enhances forecasting performance.

Proposes robust assortment optimization from observational data.

problem Real-world scenarios often violate assumptions of stable customer preferences and correct choice models.
method Develops a robust framework that accounts for potential distributional shifts in customer choice behavior.
result Uncovered the notion of ``robust item-wise coverage'' as the minimal data requirement for sample-efficient robust assortment learning.

A new matrix factorization method for high-dimensional data.

problem Exploiting sparse structures in complex data for better interpretability.
method Bayesian shrinkage priors and flexible sparse patterns modeled through row and column dependencies.
result Demonstrated practical advantages through simulation and soccer heatmap analysis.

Enhances topology optimization with multiclass microstructures using latent variable Gaussian process.

problem Lack of an inherent ordering or distance measure between different classes of microstructures.
method Extended latent-variable Gaussian process (LVGP) models to multi-response LVGP (MR-LVGP) models for metamaterials.
result Improved performance through consistent load-transfer paths for micro- and macro-structures.

GAMLA learns manifold structures with auto-encoding for global insights.

problem Limited global insight and lack of interpretable analytical descriptions in manifold learning.
method Two-round auto-encoding process to derive character and complementary representations.
result GAMLA provides global and analytical descriptions of smooth manifolds.

Paper develops adaptive models for robust energy forecasting with missing data.

problem Operational models assume complete data; missing data can degrade forecast accuracy.
method Adaptive robust optimization and adversarial machine learning for missing data.
result Proposed models perform well even with short-term missing data and significantly outperform imputation with longer-term missing data.

A theoretical performance analysis of the graph neural network (GNN) is presented. For classification tasks, the neural network approach has the advantage in terms of flexibility that it can be employed in a data-driven manner, whereas Bayesian inference requires the assumption of a specific model. A fundamental questi…

2018-10-29abs ↗pdf ↗

New insights into learning for blind inverse problems with theoretical guarantees.

problem Learning in blind inverse problems where both signal and operator are unknown.
method Data-driven approaches using Linear Minimum Mean Square Estimators (LMMSEs) with theoretical analysis.
result Established equivalences with Tikhonov-regularized formulations and derived finite-sample error bounds.

With the rise of deep neural networks for quantum chemistry applications, there is a pressing need for architectures that, beyond delivering accurate predictions of chemical properties, are readily interpretable by researchers. Here, we describe interpretation techniques for atomistic neural networks on the example of …

2018-06-27abs ↗pdf ↗

We propose a neural network approach to price EU call options that significantly outperforms some existing pricing models and comes with guarantees that its predictions are economically reasonable. To achieve this, we introduce a class of gated neural networks that automatically learn to divide-and-conquer the problem …

2016-09-14abs ↗pdf ↗

MIP-GNN uses graph neural networks to predict variable biases for MIP solvers.

problem Improving combinatorial optimization through data-driven insights.
method Encoding MILP interactions as graphs, training a graph neural network to predict variable biases, and guiding the MIP solver with these predictions.
result Significant improvements in solving binary MILPs compared to default settings of state-of-the-art solvers.

Framework generates precise synthetic populations for scalable modeling.

problem Generating accurate synthetic populations without personal data.
method Constraint-programming framework encoding aggregated statistics and structural relations.
result Exact control of demographic profiles without requiring microdata.

This paper reviews and analyzes various modeling approaches for financial index tracking.

problem Efficient replication of market index performance in financial markets.
method Categorization into three frameworks: optimization, statistical, and machine learning; empirical study on S&P 500 dataset.
result Optimization-based models deliver the most precise index tracking, statistical-based models achieve the strongest return-risk balance, and data-driven models provide competitive performance.

This article outlines a method for automatically generating models of dynamic decision-making that both have strong predictive power and are interpretable in human terms. This is useful for designing empirically grounded agent-based simulations and for gaining direct insight into observed dynamic processes. We use an e…

2016-03-26abs ↗pdf ↗

Fuzzy prediction sets generalize binary predictions to include elements at varying confidence levels.

problem Binary prediction sets are limited; fuzzy prediction sets offer richer guarantees.
method Generalize prediction sets to fuzzy sets, showing they are e-values with merging properties.
result Optimal e-values lead to optimal fuzzy prediction sets, including optimal conformal prediction.

Despite recent advances in regularisation theory, the issue of parameter selection still remains a challenge for most applications. In a recent work the framework of statistical learning was used to approximate the optimal Tikhonov regularisation parameter from noisy data. In this work, we improve their results and ext…

2018-09-23abs ↗pdf ↗

PhysVarMix predicts diverse urban trajectories with physics constraints.

problem Predicting complex urban agent trajectories with multiple plausible scenarios.
method Physics-informed variational mixture model combining learning and physics constraints.
result Superior performance compared to existing methods on benchmark datasets.

The paper addresses frequentist regret of Linear Thompson Sampling in stochastic linear bandits.

problem The frequentist regret of Linear Thompson Sampling (LinTS) is worse than its Bayesian counterpart.
method The paper proves the fundamental nature of the frequentist regret bound for LinTS and proposes a data-driven version of LinTS to achieve minimax optimal frequentist regret.
result The frequentist regret bound for LinTS is O~(ddT)\widetilde{\mathcal{O}}(d\sqrt{dT}), which is the best possible under certain conditions.

We present a new data-driven benchmark system to evaluate the performance of new MCMC samplers. Taking inspiration from the COCO benchmark in optimization, we view this task as having critical importance to machine learning and statistics given the rate at which new samplers are proposed. The common hand-crafted exampl…

2017-12-16abs ↗pdf ↗