Interactive learning framework for various settings.
problem Various interactive learning settings.
method Adapted active learning algorithm for interactive structure discovery.
result Noise-tolerant algorithm with favorable query complexity.
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.
169,341 papers · 148 categories
Trend · papers per month
48 results for “interaction identification”
A new method for identifying interactions in high dimensions.
problem Challenges in identifying interactions with many covariates.
method Interaction pursuit (IP) procedure: feature screening and selection.
result The method screens interactions separately from main effects, improving effectiveness.
Study on identifying and inferring nonlinear dynamics on unknown networks.
problem Identifying network structure in nonlinear dynamic systems with unknown interactions.
method Showed network structure is not generically identified, requiring sufficient spectral heterogeneity. Developed necessary and sufficient conditions for identification and proposed a semiparametric estimator.
result Necessary and sufficient conditions for identification of network structure in nonlinear dynamic systems.
A Sparse Bayesian Learning Algorithm for Estimation of Interaction Kernels in Motsch-Tadmor Modelstat.ML
Sparse Bayesian learning algorithm for estimating interaction kernels in Motsch-Tadmor model.
problem Data-driven identification of asymmetric interaction kernels in the Motsch-Tadmor model.
method Variational framework reformulating kernel identification as a subspace identification problem; sparse Bayesian learning algorithm with informative priors.
result Accurate, robust, and interpretable estimation of interaction kernels across various noise levels and data regimes.
Interactive framework identifies insights in power grid maps.
problem Manual identification of insights in power grid maps is laborious and expertise-dependent.
method Proposes an interactive framework using DenseU-Hierarchical VAE to learn and modulate representations.
result Framework outperforms baseline models in identifying and annotating insights.
Algorithm identifies best arm in linked bandits with reduced feedback.
problem Best arm identification in linked bandits with reduced feedback.
method Combines uniform sampling with regular bandit algorithm.
result Almost matching upper and lower bounds on sample complexity.
Interactive platform for knot invariant computation and identification.
problem Efficient computation and identification of knot invariants.
method Unified web platform using Feynman ribbon diagrams and tensor networks.
result First platform combining construction, evaluation, computation, and identification.
Paper explores how feature interactions improve XGBoost models.
problem Improving XGBoost model performance and interpretability.
method Identifies feature interactions as constraints in XGBoost models.
result Accurate identification of feature interactions leads to significant model performance improvements.
Bayesian method identifies dynamical models with uncertainty quantification.
problem Uncertainty in selecting governing equations for dynamical systems.
method Bayesian sparse identification with model averaging.
result Accurately recovers sparse interaction structures with uncertainty quantification.
MGpi model predicts social actions in group interactions.
problem Social interaction among multiple agents and groups.
method Deep neural network with Kinesic-Proxemic-Message gate for social signal gating.
result Achieves state-of-the-art performance in group identification.
MDFS selects important variables considering variable interactions, improving over simple filtering.
problem Discarding variable interactions leads to loss of relevant variables.
method MultiDimensional Feature Selection (MDFS) using information theory and CUDA C.
result Multidimensional analysis provides more reliable rankings of variable importance.
SEM-DNN learns reciprocal interactions from observational data without external instruments.
problem Estimating bidirectional interactions from endogenous data.
method Heteroscedastic neural simultaneous-equation estimator (SEM-DNN) that learns reciprocal structural interactions.
result SEM-DNN recovers structural effects more reliably than other methods under increasing information.
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.
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.
Hyper-SAGNN learns patterns in hypergraphs for complex interactions.
problem Learning patterns in hypergraphs with variable-sized heterogeneous hyperedges.
method Self-attention based graph neural network for homogeneous and heterogeneous hypergraphs.
result Significantly outperforms state-of-the-art methods on various tasks.
Improved LID for multilingual speakers using context-aware models.
problem Low accuracy for languages spoken by multilingual speakers, especially with accented speech.
method Coarser-grained acoustic model and integration with interaction context signals.
result Average 97% accuracy across all language combinations, 60% improvement in worst-case accuracy.
Improved Random Forests detect pure interactions better.
problem Random Forests struggle with certain pure interactions.
method Alternative partitioning schemes during tree construction.
result Improved Random Forests enhance fitting ability in scenarios with pure interactions.
A framework learns agent policies from interaction data.
problem Modeling complex multiagent behavior.
method Representation learning approach using imitation and agent identification.
result Demonstrated utility in diverse multiagent tasks.
ACOL learns constraints from human preferences in driving simulations.
problem Learning constraints from human preferences in driving simulations.
method Adaptive Constraint Learning (ACOL) algorithm for constrained linear best-arm identification.
result ACOL's sample complexity matches worst-case lower bound and is significantly tighter in the average case.
IPDC method identifies interactions in high-dimensional multi-response models efficiently.
problem Identifying important interactions in high-dimensional multi-response models.
method Two-stage method using distance correlation for feature screening followed by feature selection.
result IPDC method is computationally efficient and effective even with diverging number of responses.
TSCI estimates treatment effects using machine learning and data-adaptive methods for invalid instruments.
problem Estimating treatment effects with invalid instruments.
method Two-stage algorithm: first stage uses machine learning for nonlinearities, second stage selects and projects out instrument violations.
result Effective treatment effect estimation even with invalid instruments.
ASTPN improves video-based person re-identification by jointly attending to spatial and temporal features.
problem Video-based person re-identification in surveillance and HCI.
method Joint Spatial and Temporal Attention Pooling Network (ASTPN).
result ASTPN outperforms state-of-the-art methods on multiple datasets.
Deep Rule Forests identifies drug-drug and drug-disease interactions causing AKI.
problem Identifying drug-drug and drug-disease interactions leading to AKI.
method Deep Rule Forests (DRF) algorithm discovering rules from multilayer tree models.
result DRF model outperforms other algorithms in prediction accuracy and interpretability.
Paper connects system identification and machine learning using RKHSs.
problem Combining system identification and machine learning for dynamic systems.
method Introducing RKHSs of dynamic systems and deriving stability conditions.
result RKHSs of dynamic systems facilitate the design of new kernels for system identification.
ALICE uses ML for particle identification across a wide momentum range.
problem Effective combination of detector information for particle identification.
method Machine Learning, specifically Random Forest and Domain Adaptation Neural Networks.
result Advanced ML solutions improve particle identification accuracy.
Paper studies collaboration in multi-armed bandits with limited interaction.
problem Identifying the best arm collaboratively with limited communication.
method Developed techniques to quantify and prove round-speedup tradeoffs.
result Almost tight round-speedup tradeoffs for distributed exploration.
AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.
problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.
Unified local and global explanations through functional decomposition of low dimensional structures.
problem Tackles the challenge of extracting meaningful local and global explanations from machine learning models.
method Proposes a new identification constraint to decompose the global representation into main and interaction components of arbitrary order.
result Unified local and global explanations by connecting partial dependence plots and interventional SHAP values.
Causal Interaction Trees identify treatment subgroup effects in observational data.
problem Identifying subgroups with enhanced treatment effects in observational studies.
method Extending Classification and Regression Trees with subgroup-specific treatment effect estimators.
result The proposed algorithms enhance treatment effect heterogeneity in subgroups.
IDS integrates physics engines into deep learning for efficient, interpretable system identification.
problem Lack of generalization and interpretability in learning-based models of physical systems.
method Interactive Differentiable Simulation (IDS) that allows efficient, accurate inference of physical properties.
result Automatic task-based robot design and parameter estimation for nonlinear dynamical systems.
DAGnosis uses DAGs to identify and localize data inconsistencies.
problem Handling data inconsistencies in machine learning models at deployment time.
method Directed acyclic graphs (DAGs) to encode feature probability distribution and independencies.
result Localization of inconsistencies and insights into their causes.
iRF detects stable high-order interactions in genomics data.
problem Understanding high-order interactions in genomics data.
method Iterative Random Forest algorithm (iRF) for stable high-order interaction detection.
result iRF identifies stable high-order interactions with computational cost similar to Random Forest.
New method detects and measures malicious users in recommendation algorithms.
problem Identifying and quantifying malicious user activity in recommendation systems.
method Probabilistic programming for a disentangled model of malicious and regular user behavior.
result Simulation-based measure for quantifying malicious user effects.
Method identifies IPS governing equations from particle data efficiently.
problem Identify governing equations of interacting particle systems efficiently.
method Combines mean-field theory and WSINDy for large and .
result Converges with rate for .
Efficiently controls unknown linear systems with black-box interactions.
problem Controlling an unknown linear dynamical system from black-box interactions.
method First efficient algorithm with sublinear regret, using robust system identification.
result Resolves open problem on stochastic LQR and black-box LQR control.
Study causal effects on humans in mixed human-AI systems with unobserved unit types.
problem Estimating causal effects on humans in systems with unobserved unit types and interaction networks.
method Assumed human-AI prior, causal message passing (CMP) framework, subpopulation analysis.
result Consistently recover human-specific causal effects using subpopulations with varying expected human composition and treatment exposure.
Method learns cell interaction rules from individual trajectories.
problem Inferring interaction rules from heterogeneous cellular data.
method WSINDy for second order IPSs, learning individual cell models.
result Efficiently identifies different species and best-fit models for each.
PromID predicts human promoter positions with high accuracy.
problem Difficulties in identifying human promoter sequences.
method Deep learning approach predicting exact TSS positions.
result Significantly reduces false positive predictions.
Concept bottleneck models enable concept manipulation for model interpretation.
problem Training models to directly predict labels without intermediate concepts.
method Train models to predict intermediate concepts at training time, then use these concepts to predict labels.
result Concept bottleneck models achieve competitive accuracy with standard models while enabling concept manipulation.
A new method for identifying the best arm in multi-armed bandits with mediator feedback.
problem Sequential decision-making with unknown mediator policies.
method Best-arm identification under mediators' feedback (BAI-MF) with statistical lower bound and sequential decision-making strategy.
result The proposed algorithm matches the lower bound on sample complexity for identifying the best arm.
Investigates safe decision-making in interactive environments.
problem Learning the best safe decision in real-time systems.
method Reduces to a constrained linear bandits problem, proposes adaptive experimental design-based algorithm.
result First results on best-arm identification in linear bandits with safety constraints.
Sequence-based model predicts protein-protein interactions with high accuracy.
problem Predicting protein-protein interactions for alternative treatment options.
method Sequence clustering, discrete cosine transform, supervised machine learning, SVM with RBF.
result Mesh model achieved an average AUC of 0.84.
A nonlocal physics-informed deep learning framework using the peridynamic differential operatorcs.LG
Develops a nonlocal PINN framework using PDDO for better solution of PDEs with sharp gradients.
problem Dealing with sharp gradients in solutions of PDEs using traditional PINN approaches.
method Integrates long-range interactions (nonlocality) into PINN using Peridynamic Differential Operator (PDDO).
result Nonlocal PINN approach improves solution accuracy and parameter inference for problems with sharp gradients.
The study combines social interaction data into a single network, identifying stable groups of chimpanzees.
problem Identifying stable groups of chimpanzees based on social interactions over time.
method Network representation, weighted proximity weights, principled loss function, statistical tests.
result The approach detects stable groups of chimpanzees that stay related for a significant length of time.
A method clusters genes in large gene regulatory networks using semi-supervised hierarchical clustering.
problem Challenging task of identifying interaction clusters in large gene regulatory networks due to data noise and inconsistency.
method SHC-DC: a semi-supervised hierarchical clustering method using deconvolved correlation matrix.
result SHC-DC discovers interaction modules enriched in various signal pathways, validating sleep's impact on interleukin levels and related pathways.
Bayesian sensitivity analysis accounts for model uncertainty.
problem Assessing variable importance in nonlinear models.
method Differentiating Rényi divergence of predictive distribution.
result Accurate and reliable identification of important variables and interactions.
BCI system improves word selection efficiency using sequential best-arm identification.
problem Conventional non-adaptive BCI paradigms lead to a lengthy learning process.
method Casted as sequence of best-arm identification tasks in multi-armed bandits, using pre-trained LLMs and STTS algorithm.
result Substantial empirical improvement in word selection efficiency demonstrated.
Versatile model for High Energy Physics events.
problem Modeling complex interactions in high-energy physics data.
method Energy-based probabilistic model with multi-purpose architecture.
result Achieves success in diverse applications like simulation, anomaly detection, and particle identification.