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

4108201,2301,640 · Jun 202019922001200920172026
48 results for interactive model analysis

New method aggregates GDS analyses of randomly selected interaction models to identify important factors in screening experiments.

problem Erroneous conclusions from main-effects models in screening experiments.
method Gauss-Dantzig Selector Aggregation over Random Models (GDS-ARM).
result Identifies important factors by aggregating GDS analyses of randomly selected interaction models.

Interactive EMA combines multiple explainability methods to improve model understanding.

problem Isolated explanations of machine learning models lead to misunderstandings and wrong reasoning.
method Interactive EMA (IEMA) combines multiple explainability methods sequentially.
result Interactive EMA increases the performance and confidence of human decision making.

Interactive DR framework for comparing datasets.

problem Limited flexibility in existing DR methods for comparative analysis.
method Unified linear comparative analysis (ULCA) with interactive optimization and visualization.
result ULCA and optimization algorithm improve comparative analysis efficiency and flexibility.

Computational modeling of human multimodal language is an emerging research area in natural language processing spanning the language, visual and acoustic modalities. Comprehending multimodal language requires modeling not only the interactions within each modality (intra-modal interactions) but more importantly the in…

2018-08-12abs ↗pdf ↗

Study improves LLMs for PPI analysis by addressing uncertainty.

problem Uncertainty in LLM predictions for PPIs.
method Fine-tuned LLaMA-3 and BioMedGPT models, LoRA ensembles, Bayesian LoRA for UQ.
result Competitive PPI identification performance across diverse disease contexts.

The paper analyzes the dynamics of tokens in transformer models at moderate interaction levels.

problem Understanding the evolution of tokens in transformer models at moderate interaction levels.
method Modeling transformer models as a system of particles interacting in a mean-field way and studying the corresponding dynamics.
result Characterization and convergence of the limiting dynamics in different phases of the system.

A new method detects interactions in neural networks using topological analysis.

problem Detecting interactions between input features in neural networks.
method Topological analysis of neural network connectivity to quantify interaction strength.
result The PID algorithm outperforms state-of-the-art baselines in interaction detection tasks.

Motivation: Cell-biological processes are regulated through a complex network of interactions between genes and their products. The processes, their activating conditions, and the associated transcriptional responses are often unknown. Organism-wide modeling of network activation can reveal unique and shared mechanisms…

2012-02-02abs ↗pdf ↗

For nonlinear supervised learning models, assessing the importance of predictor variables or their interactions is not straightforward because it can vary in the domain of the variables. Importance can be assessed locally with sensitivity analysis using general methods that rely on the model's predictions or their deri…

2019-10-17abs ↗pdf ↗

The assessment of co-movement among metals is crucial to better understand the behaviors of the metal prices and the interactions with others that affect the changes in prices. In this study, both Wavelet Analysis and VARMA (Vector Autoregressive Moving Average) models are utilized. First, Multiple Wavelet Coherence (M…

2016-02-05abs ↗pdf ↗

In this study, we analyzed the activity of monkey V1 neurons responding to grating stimuli of different orientations using inference methods for a time-dependent Ising model. The method provides optimal estimation of time-dependent neural interactions with credible intervals according to the sequential Bayes estimation…

2018-07-24abs ↗pdf ↗

ACS is an interactive framework for model-free selection with guaranteed error control.

problem Model-free selection with rigorous error control.
method Adaptive conformal selection with human-in-the-loop data exploration and new information incorporation.
result ACS provides concrete selection algorithms for various goals, including model update/selection, diversified selection, and incorporating new data.

KAPLAN-HR models survival data without manual interactions, outperforming existing methods.

problem Survival analysis challenges with complex covariates and time-varying effects.
method Kolmogorov-Arnold Networks (KAN) for nonparametric hazard estimation.
result KAPLAN-HR matches or exceeds existing methods in clinical survival data.

We develop a general framework to analyze the distribution functions of wealth and income. Within this framework we study wealth distribution in a society by using a model which turns on two-party trading for poor people while for rich people interaction with wealthy entities (huge reservoir) is relevant. At equilibriu…

2003-10-15abs ↗pdf ↗

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.

In this work the system of agents is applied to establish a model of the nonlinear distributed signal processing. The evolution of the system of the agents - by the prediction time scale diversified trend followers, has been studied for the stochastic time-varying environments represented by the real currency-exchange …

2011-10-12abs ↗pdf ↗

Gaussian process framework learns interaction kernels in multi-species particle systems.

problem Learning interaction kernels in multi-species interacting particle systems from trajectory data.
method Nonparametric Bayesian approach with Gaussian processes.
result Established rigorous statistical guarantees for recoverability and optimality of interaction kernels.

Agent Based Modeling (ABM) has become a widespread approach to model complex interactions. In this chapter after briefly summarizing some features of ABM the different approaches in modeling spatial interactions are discussed. It is stressed that agents can interact either indirectly through a shared environment and/or…

2014-05-04abs ↗pdf ↗

Novel ML model predicts solvation free energies from atom interactions.

problem Predicting solvation free energies from atomistic interactions.
method Two encoding functions extract atomic feature vectors, interactions calculated by inner product.
result Outstanding performance and transferability on 6,493 experimental measurements.

New regularization scheme for FMs improves feature interaction selection.

problem Feature selection in FMs leads to loss of feature interactions.
method Proposes a new regularization scheme for FMs with upper bound of 1\ell_1 regularizer.
result Improves feature interaction selection without restricting sparsity patterns.

SDAMI enhances interpretable high-dimensional regression with sparse deep learning and footprint principle.

problem Personalized models for small samples and high-dimensional features with interpretability.
method Sparse Deep Additive Model with Interactions (SDAMI) combining sparsity-driven feature selection and deep subnetworks.
result SDAMI successfully identifies pure interactions with near-zero false positive rates.

This paper proposes a web-based visual graph analytics platform for interactive graph mining, visualization, and real-time exploration of networks. GraphVis is fast, intuitive, and flexible, combining interactive visualizations with analytic techniques to reveal important patterns and insights for sense making, reasoni…

2015-02-02abs ↗pdf ↗

We describe and extract time-ordered multibody interactions from complex systems.

problem Complex systems with temporal and multibody dependencies.
method Decompose multivariate Markov chains into time-ordered multibody interactions. Algorithm to extract interactions from data. Measure complexity of interaction ensembles.
result Robust and efficient algorithm to infer time-ordered multibody interactions from data.

Study identifies cancer genes through graph anomaly analysis of protein interactions.

problem Insufficient modeling of biological information in protein interaction networks for cancer gene identification.
method Proposes HIerarchical-Perspective Graph Neural Network (HIPGNN) to detect weight heterogeneity and spectral flattening in cancer gene nodes.
result HIPGNN detects weight heterogeneity and spectral flattening, leading to improved cancer gene identification.

Proposes ICE-based metric for better understanding interactions in black-box models.

problem Misleading global sensitivity metrics in black-box models due to interaction effects.
method Individual Conditional Expectation (ICE) curves to compute feature importance and interactions.
result ICE-based metric provides richer insights into feature importance and interactions.

In this paper we provide a comprehensive analysis of a structural model for the dynamics of prices of assets traded in a market originally proposed in [1]. The model takes the form of an interacting generalization of the geometric Brownian motion model. It is formally equivalent to a model describing the stochastic dyn…

2017-09-29abs ↗pdf ↗

New method quantifies feature interactions in machine learning models.

problem Capturing high-order interactions and feature contributions in predictive models.
method Information-theoretic approach using Conditional Mutual Information (CMI) via k-NN.
result Accurately recovers feature interactions in synthetic and real-world datasets.

Framework certifies fairness of machine learning models interactively and privately.

problem Certifying fairness of machine learning models in privacy-preserving scenarios.
method Interactive test with cryptographic techniques for fairness certification.
result Empirical evaluation of fairness for various models and definitions.

A game-theoretic framework identifies influential hyperparameters for neural networks.

problem Understanding which hyperparameters are most important for neural network performance.
method Employing Shapley Effects for global sensitivity analysis and Pareto front sets for identifying effective configurations.
result Reveals which hyperparameters are most influential for different objectives in neural networks.

Graphon game model simplifies stochastic interactions among agents.

problem Complex interactions among heterogeneous agents in stochastic games.
method Introduced a discrete-time graphon game formulation with a representative player.
result Existence and uniqueness of graphon equilibrium proven with mild assumptions.

Collaborative Trees model analyzes feature interactions and additive effects.

problem Analyzing complex statistical associations between features and response variables.
method Proposes a novel tree model and its bagging version to decompose mean decrease in impurity and visualize feature contributions.
result Demonstrates the superior capability of the tree model in estimating additive effects and interaction effects.

Interactive recommender systems that enable the interactions between users and the recommender system have attracted increasing research attentions. Previous methods mainly focus on optimizing recommendation accuracy. However, they usually ignore the diversity of the recommendation results, thus usually results in unsa…

2019-07-01abs ↗pdf ↗