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.
We introduce interactive structure discovery, a generic framework that encompasses many interactive learning settings, including active learning, top-k item identification, interactive drug discovery, and others. We adapt a recently developed active learning algorithm of Tosh and Dasgupta (2017) for interactive structu…
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.
New algorithm trains latent diffusion models using interacting particles.
problem Training latent diffusion models efficiently and accurately.
method Reformulate training as minimizing a free energy functional, then approximate with interacting particles.
result The new algorithm outperforms previous methods in experiments.
Paper improves neural interaction modeling using nonlinear Hawkes processes.
problem Inability of classic Hawkes process to model inhibitory interactions.
method Augmented auxiliary latent variables and EM algorithm for efficient inference.
result Demonstrates accurate and efficient estimation of neural interaction dynamics.
New algorithm solves complex mean-field Schrödinger bridge problem.
problem Designing a controller for diffusion processes with nonlocal interaction.
method Generalized Hopf-Cole transform and Sinkhorn-type algorithm.
result Convergence guarantees for the proposed algorithm under mild assumptions.
We consider interactive algorithms in the pool-based setting, and in the stream-based setting. Interactive algorithms observe suggested elements (representing actions or queries), and interactively select some of them and receive responses. Pool-based algorithms can select elements at any order, while stream-based algo…
Swarm intelligence is the collective behavior emerging in systems with locally interacting components. Because of their self-organization capabilities, swarm-based systems show essential properties for handling real-world problems such as robustness, scalability, and flexibility. Yet, we do not know why swarm-based alg…
One component of precision medicine is to construct prediction models with their predictive ability as high as possible, e.g. to enable individual risk prediction. In genetic epidemiology, complex diseases have a polygenic basis and a common assumption is that biological and genetic features affect the outcome under co…
Algorithm learns interaction kernels for particle systems from data.
problem Understanding and modeling interactions in systems of interacting particles.
method Nonparametric algorithm using least squares with regularization, probabilistic error functional, and reproducing kernel Hilbert space convergence.
result The algorithm converges optimally and accurately learns interaction kernels.
Estimates network structure and interaction rules from multiple agent trajectories.
problem Modeling multi-agent systems on networks from data.
method Jointly infers network topology and interaction kernels using non-convex optimization.
result ORALS estimator is consistent and asymptotically normal under coercivity conditions.
Interactive machine learning improves learning efficiency with user input.
problem Expensive, time-consuming, or risky acquisition of labeled data and decision-making.
method Develops new algorithms for active learning, sequential decision making, and model selection under partial feedback.
result First efficient algorithms achieving exponential label savings and independent of action space size.
Interactive visualization helps understand complex machine learning models.
problem Low interpretability of machine learning models.
method Interactive slice visualization of predictor space, using interaction or touring algorithms.
result Enhances understanding and validation of machine learning model fits.
Methodology for learning sparse models using all multiplicative interactions efficiently.
problem Learning high-order feature interactions with fine control.
method Fine Control Kernel framework, combining Fenchel Duality and Apriori algorithm.
result Efficiently solves large sparse learning problems with sparse feature screening rules.
When performing regression on a dataset with p variables, it is often of interest to go beyond using main linear effects and include interactions as products between individual variables. For small-scale problems, these interactions can be computed explicitly but this leads to a computational complexity of at least $…
Paper introduces IC-index to evaluate interaction prediction methods.
problem Evaluate interaction prediction methods using IC-index.
method IC-index measures interaction direction prediction performance.
result IC-index complements existing prediction performance estimators.
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.
We consider learning under the constraint of local differential privacy (LDP). For many learning problems known efficient algorithms in this model require many rounds of communication between the server and the clients holding the data points. Yet multi-round protocols are prohibitively slow in practice due to network …
Relief based algorithms have often been claimed to uncover feature interactions. However, it is still unclear whether and how interaction terms will be differentiated from marginal effects. In this paper, we propose IMMIGRATE algorithm by including and training weights for interaction terms. Besides applying the large …
New algorithm tames non-linear growth in stochastic optimization.
problem Computational challenges in E-step of EM framework.
method Employing interacting particle systems and taming techniques to create tIPLA.
result Non-asymptotic convergence error estimates in Wasserstein-2 distance for tIPLA.
Models which estimate main effects of individual variables alongside interaction effects have an identifiability challenge: effects can be freely moved between main effects and interaction effects without changing the model prediction. This is a critical problem for interpretability because it permits "contradictory" m…
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.
A new network-based method for high-level data classification without normalization.
problem Evaluation and classification of data with hidden attribute interactions.
method A new network-building methodology based on attribute-attribute interactions, avoiding normalization.
result Improvement in accuracy of high-level classification using betweenness centrality.
Computational swarm intelligence consists of multiple artificial simple agents exchanging information while exploring a search space. Despite a rich literature in the field, with works improving old approaches and proposing new ones, the mechanism by which complex behavior emerges in these systems is still not well und…
We present an interactive version of an evidence-driven state-merging (EDSM) algorithm for learning variants of finite state automata. Learning these automata often amounts to recovering or reverse engineering the model generating the data despite noisy, incomplete, or imperfectly sampled data sources rather than optim…
Develops a new algorithm for estimating model parameters using interacting particle systems.
problem Estimating parameters of latent variable models.
method Interacting Particle Langevin Algorithm (IPLA) based on Langevin diffusion.
result Nonasymptotic optimisation error bounds for the estimator.
New complexity measure for interactive learning reduces regret to near-optimal levels.
problem Challenges in sample-efficient, adaptive learning algorithms for interactive decision making.
method Introduces the Decision-Estimation Coefficient and the Estimation-to-Decisions (E2D) principle.
result Unified algorithm design principle E2D achieves optimal sample-efficient learning.
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.
Improved model-based reinforcement learning for interactive dialogue tasks reduces sample needs and improves performance.
problem Limited data and high sample cost in interactive dialogue systems.
method Model-based actor-critic approach with an environment model and planner.
result 70 times fewer samples required compared to baseline model-free algorithm, with 2x better asymptotic performance.
The paper introduces metrics for robust unsupervised learning of vehicle interactions.
problem Robust representation learning of temporal dynamic interactions in robotics.
method Geometric approach using Procrustes distance and optimal transport for comparing interaction distributions.
result Metrics for assessing stability and comparing interaction learning algorithms.
Interactions such as double negation in sentences and scene interactions in images are common forms of complex dependencies captured by state-of-the-art machine learning models. We propose Mahé, a novel approach to provide Model-agnostic hierarchical éxplanations of how powerful machine learning models, such as deep ne…
Proposes I-prior extension for additive interaction models.
problem Challenges in estimating and selecting models with interactions.
method Extends I-prior methodology to multiple covariates, introducing a parsimonious model specification.
result Improves estimation and model selection for additive interaction models.
New robust algorithms improve learning with feature feedback.
problem Interactive learning with discriminative feature feedback.
method Developed new robust interactive learning algorithms with improved mistake bounds.
result Achieved significantly lower mistake bounds in adversarial and stochastic settings.
Evology models US equity mutual funds interactions for investment strategies.
problem Understanding complex interactions in financial markets.
method Agent-based model (ABM) of US stock market participants and their strategies.
result Trading strategies interact with other market participants and conditions.
Unified framework for lower bounds in interactive decision making.
problem Challenges in interactive decision making, especially bandits and reinforcement learning.
method Interactive Fano method and Fractional Covering Number.
result Unified characterization of learnability for stochastic bandit problems and tight lower bounds for interactive decision making.
New algorithms for interactive learning match minimax bounds efficiently.
problem Interactive learning in the realizable setting with computational efficiency.
method General framework, computationally efficient algorithms, Monte Carlo hit-and-run sampling.
result Sample complexities quantifiable in terms of combinatorial quantities, computationally efficient.
We provide sharp empirical estimates of expectation, variance and normal approximation for a class of statistics whose variation in any argument does not change too much when another argument is modified. Examples of such weak interactions are furnished by U- and V-statistics, Lipschitz L-statistics and various error f…
Alpha-GPT mines new trading signals with human-AI interaction.
problem Mining new alphas for effective trading signals.
method Human-AI interaction and prompt engineering algorithmic framework.
result Demonstrates Alpha-GPT's effectiveness in generating creative, insightful, and effective alphas.
We propose a Bayesian regression method that accounts for multi-way interactions of arbitrary orders among the predictor variables. Our model makes use of a factorization mechanism for representing the regression coefficients of interactions among the predictors, while the interaction selection is guided by a prior dis…
GAMI-Tree uses model-based trees to fit low-order fANOVA models.
problem Fitting interpretable fANOVA models with low-order interactions.
method GAMI-Tree uses model-based trees and a new interaction filtering method.
result GAMI-Tree outperforms EBM and GAMI-Net in predictive performance and interpretability.
Feature selection is a technique to screen out less important features. Many existing supervised feature selection algorithms use redundancy and relevancy as the main criteria to select features. However, feature interaction, potentially a key characteristic in real-world problems, has not received much attention. As a…
Estimates hypergraphons for modeling complex interactions efficiently.
problem Modeling higher-order interactions using hypergraphons.
method Restricted class of Simple Lipschitz Hypergraphons (SLH) for efficient estimation.
result Optimal rates of convergence for SLH estimator.
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.
New algorithms improve inference in non-differentiable models.
problem Inference and learning in latent variable models with non-differentiable densities.
method Proximal interacting particle Langevin algorithms (PIPLA).
result Nonasymptotic bounds and effectiveness demonstrated in various models.
Optimal locally private hypothesis selection with interactive rounds.
problem Locally private hypothesis selection under i.i.d. samples.
method Developed an ε-LDP algorithm using critical queries for hypothesis selection.
result Achieved optimal sample complexity of Θ(k/α²ε²) for hypothesis selection.
IAL uses interactive learning to improve model performance with minimal human feedback.
problem Overfitting and high human interaction cost in training neural networks.
method IAL framework with NAP attention generator and reranking algorithm.
result IAL significantly outperforms baselines with less retraining and human interaction.
This work describes simple and efficient algorithms for interactively learning non-binary concepts in the learning from random counter-examples (LRC) model. Here, learning takes place from random counter-examples that the learner receives in response to their proper equivalence queries. In this context, the learning ti…
This paper uses Gaussian mixtures to mimic interactions in large language models.
problem Simulating interactions in large language models (LLMs) is computationally expensive.
method Developed an interacting Gaussian mixture model (GMM) system to mimic LLM interactions.
result The interacting Gaussian mixture model system can generate, exchange, and update data and parameters efficiently.