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

275480107 · May 202619922001200920172026
48 results for disciplinary shifts

Current pharmaceutical formulation development still strongly relies on the traditional trial-and-error approach by individual experiences of pharmaceutical scientists, which is laborious, time-consuming and costly. Recently, deep learning has been widely applied in many challenging domains because of its important cap…

2018-09-06abs ↗pdf ↗

These are the proceedings of the workshop "Math in the Black Forest", which brought together researchers in shape analysis to discuss promising new directions. Shape analysis is an inter-disciplinary area of research with theoretical foundations in infinite-dimensional Riemannian geometry, geometric statistics, and geo…

2018-11-04abs ↗pdf ↗

New method integrates computer models from different disciplines with better predictive performance.

problem Integration of multi-disciplinary computer models with distinct complexities and computation times.
method Developed a linked deep Gaussian process (DGP) method that integrates individual Gaussian process emulators in a network.
result Linked deep Gaussian process emulators outperform standard LGP emulators and single DGPs fitted to the network as a whole.

REMAL: Residual Equilibrium Manifold Active Learning for Surrogate-Based Multidisciplinary Design Analysis

problem Multidisciplinary design analysis of coupled engineering systems requires solving equilibrium states where all disciplinary coupling variables are consistent.
method Residual manifold surrogate modeling framework for coupled systems.
result REMAL learns a surrogate model of the joint residual manifold via multitask Gaussian process models.

This study synthesizes stablecoin systems and develops a performance evaluation framework.

problem Fragmented academic research on stablecoins across economics, law, and computer science.
method Multi-method research design including literature synthesis, performance evaluation framework, and case study.
result Unified taxonomy and performance evaluation framework for stablecoin design.

This essay suggests that a proper assessment of the presently unfolding financial crisis, and its cure, requires going back at least to the late 1990s, accounting for the cumulative effect of the ITC, real-estate and financial derivative bubbles. We focus on the deep loss of trust, not only in Wall Street, but more imp…

2008-10-25abs ↗pdf ↗

Investor attention is an important concept in behavioral finance. Many articles have conducted cross-disciplinary research leading by this concept. In this paper, we use data extraction technology to collect a large number of Baidu Index keyword search volume data. After analyzing the data, we draw a conclusion that ha…

2019-11-02abs ↗pdf ↗

Bayesian optimization reduces computational effort in aircraft design optimization.

problem High computational cost in industrial aircraft design optimization.
method Constrained Bayesian optimization (Super Efficient Global Optimization with Mixture of Experts)
result Significant computational efficiency improvements over existing Isight optimizers.

Understanding how funding and 4H context regulate crypto markets.

problem Analyzing the chaotic appearance of financial markets.
method Observing interactions between market context and capital conditions in the 4H timeframe.
result Ranges in crypto markets are strategic positioning by informed participants, not indecision.

Economies are complex man-made systems where organisms and markets interact according to motivations and principles not entirely understood yet. The increasing dissatisfaction with the postulates of traditional economics i.e. perfectly rational agents, interacting through efficient markets in the search of equilibrium,…

2012-05-14abs ↗pdf ↗

In the same way as the Hilbert Program was a response to the foundational crisis of mathematics, this article tries to formulate a research program for the socio-economic sciences. The aim of this contribution is to stimulate research in order to close serious knowledge gaps in mainstream economics that the recent fina…

2010-12-20abs ↗pdf ↗

Artificial neural networks (ANNs) have achieved significant success in tackling classical and modern machine learning problems. As learning problems grow in scale and complexity, and expand into multi-disciplinary territory, a more modular approach for scaling ANNs will be needed. Modular neural networks (MNNs) are neu…

2019-04-29abs ↗pdf ↗

In this paper, we formulate a new local move on virtual knot diagram, called arc shift move. Further, we extend it to another local move called region arc shift defined on a region of a virtual knot diagram. We establish that these arc shift and region arc shift moves are unknotting operations by showing that any virtu…

2018-08-13abs ↗pdf ↗

Paper proposes SJS model to estimate model performance under covariate and label shifts.

problem Estimating model performance when both covariates and labels shift.
method Sparse Joint Shift (SJS) model and SEES algorithm.
result SEES achieves significant shift estimation error improvements over existing approaches.

Extends FJS analysis to general label spaces, including classification and regression.

problem Distribution shift in general label spaces, including covariate and label shifts.
method Proposes a framework for analyzing FJS in general label spaces and generalizes existing results.
result Generalizes FJS analysis to general label spaces, including classification and regression.

Paper tackles high-dimensional quantile regression with distribution shift using transfer learning.

problem Efficiency of knowledge transfer is severely impacted by distribution shift in high-dimensional regression.
method Proposes a novel transferable set and framework for three types of distribution shift: parameter, covariate, and residual.
result Establishes estimation error bounds and source detection consistency for the proposed method.

Unified learning bound for covariate and concept shifts.

problem Generalization under distribution shift in machine learning.
method Support-agnostic definitions of covariate and concept shifts using entropic optimal transport, leading to a unified error bound applicable to various loss functions and label spaces.
result Development of estimators for shifts with concentration guarantees and the DataShifts algorithm for quantifying and estimating the error bound.

Proposes SGShift to identify shifted features causing model performance degradation under concept shift.

problem Concept shift leading to miscalibration in ML models across domains.
method SGShift method for identifying sparse set of shifted features using feature selection and statistical tools.
result SGShift identifies shifted features more accurately than baseline methods, requires few samples in the shifted domain, and is robust to complex cases.

High-frequency trading models fail due to overfitting and survivor bias.

problem Failure of hybrid DRL-EC trading systems in high-frequency environments.
method Deployed a population of 500 agents in a high-frequency cryptocurrency environment, analyzing failure modes through multi-disciplinary lens.
result Increasing model complexity without information asymmetry exacerbates systemic fragility.

Graphs models are vulnerable to distribution shifts, which this work explains and mitigates.

problem Graph Neural Networks (GNNs) are susceptible to distribution shift, leading to performance degradation.
method Theoretical analysis quantifying conditional shift, proposing an approach to estimate and minimize it.
result The proposed approach demonstrates up to 10% absolute ROC AUC improvement under various distribution shifts.

RLSbench benchmarks domain adaptation under label proportion shifts, revealing widespread failures and proposing a two-step meta-algorithm.

problem Domain adaptation under label proportion shifts is poorly understood and inconsistent across methods.
method RLSbench introduces a large-scale benchmark with 500 distribution shift pairs. It proposes a two-step meta-algorithm to improve domain adaptation methods under label proportion shifts.
result The two-step meta-algorithm improves domain adaptation methods by 2-10% accuracy points under large label proportion shifts.

Paper tackles backwards-compatible data adaptation for confounded covariate and label shifts.

problem Adapt covariates to predict labels confounded with covariate shifts.
method Proposes confounded shift framework based on minimizing divergence between source and target conditional distributions, conditioning on confounders.
result Demonstrates approach on synthetic and real datasets, achieving backwards-compatible data adaptation.

The classical shift retrieval problem considers two signals in vector form that are related by a shift. The problem is of great importance in many applications and is typically solved by maximizing the cross-correlation between the two signals. Inspired by compressive sensing, in this paper, we seek to estimate the shi…

2013-03-20abs ↗pdf ↗

Combines adversarial and interventional robustness for machine learning models.

problem Designing robust models for distribution shifts in machine learning.
method RISe formulation using distributionally robust optimization.
result Demonstrates efficacy of RISe approach with synthetic and real-world datasets.

This research examines how model explanations change under distribution shifts in tabular data.

problem Detecting distribution shifts in tabular data affecting model performance and explanations.
method Investigates the relationship between model performance and explanation characteristics under distribution shifts.
result Explanation shifts are a better indicator for detecting predictive performance changes than traditional distribution shift techniques.

The paper explores new algebraic structures and morphisms in graded settings.

problem Understanding new algebraic structures and morphisms in graded settings.
method Introducing and analyzing LL_{\infty}-, PP_{\infty}-, and SS_{\infty}-algebras, and thick morphisms in a Z2imesZ\mathbb{Z}_2 imes \mathbb{Z}-graded context.
result Shifted SS_{\infty}-thick morphisms induce LL_{\infty}-morphisms of shifted SS_{\infty}-structures.

In this paper, we study how the mean shift algorithm can be used to denoise a dataset. We introduce a new framework to analyze the mean shift algorithm as a denoising approach by viewing the algorithm as an operator on a distribution function. We investigate how the mean shift algorithm changes the distribution and sho…

2016-10-13abs ↗pdf ↗

Method identifies shifts leading to large model performance differences.

problem Detecting shifts in distribution that affect model performance.
method Parametric changes in causal mechanisms define robustness sets; worst-case optimization problem approximated as non-convex quadratic.
result Second-order approximation of worst-case loss for small shifts, leading to efficient algorithms.

FSL-Net detects and localizes feature shifts in large, high-dimensional datasets.

problem Feature shifts between data sources lead to erroneous features in various applications.
method FSL-Net is a neural network trained on multiple datasets to localize feature shifts.
result FSL-Net accurately localizes feature shifts from unseen datasets without re-training.

DetectShift framework detects and quantifies dataset shifts in various data types.

problem Frequent dataset shifts decrease supervised learning performance.
method DetectShift framework quantifies and tests for multiple dataset shifts in various data types.
result DetectShift framework effectively detects dataset shifts even in higher dimensions.

Corrects distribution shift in target shift scenarios using importance weighting.

problem Analyzes importance weighting for correcting distribution shift under target shift.
method Analyzed importance-weighted kernel ridge regression under target shift.
result Shows that importance weighting corrects the train-test mismatch without altering input-space complexity.