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.
iKF method uncovers complex variable interactions for scientific discovery.
problem Limited interpretability of existing models in decision-making applications.
method Iterative Kings' Forests (iKF) method to uncover multi-order interactions.
result iKF provides strong interpretive power for explainable modeling.
TLMG4Eth combines language and graph models for Ethereum fraud detection.
problem Current fraud detection methods fail to consider semantic and similarity patterns in Ethereum transactions.
method TLMG4Eth uses a transaction language model and graph-based methods to capture semantic, similarity, and structural features.
result TLMG4Eth detects anomalies in Ethereum transactions more effectively than existing methods.
Proposes PEID for analyzing synergistic causation in complex systems.
problem Challenges in identifying and analyzing synergistic causation in complex systems.
method Partial Effective Information Decomposition (PEID) framework.
result Unified and computable characterization of synergistic causal relations.
Enhances graph classification with multiple graphs.
problem Improving graph classification accuracy with multiple graphs.
method Graph fusion embedding using encoder embedding.
result The method consistently improves classification accuracy for large vertex sets.
Study intrinsic motivation for synergistic tasks in reinforcement learning.
problem Sparse-reward synergistic tasks where multiple agents must work together.
method Propose incentivizing actions that affect the world in ways not achievable individually, using either true states or a dynamics model.
result Our approach yields more efficient learning than typical methods.
Signed pairwise interactions conflate uniqueness, redundancy, and synergy
problem Signed pairwise interactions conflate uniqueness, redundancy, and synergy
method Stochastic Hi-Fi
result Stochastic Hi-Fi recovers structure missed by scalar baselines
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.
Paper proposes a new framework to mine synergistic formulaic alphas for better stock trend forecasting.
problem Mining alphas separately ignores their combined performance, leading to suboptimal models.
method Proposes a reinforcement learning-based framework that optimizes the mining of synergistic formulaic alpha sets.
result Demonstrates higher returns in stock trend forecasting compared to previous approaches.
SPINN optimizes neural network inference on devices and cloud.
problem Inference on mobile devices is challenging due to high computational demands and dynamic connectivity.
method Synergistic progressive inference with a novel scheduler.
result SPINN achieves up to 2x higher throughput and reduces server cost by up to 6.8x.
New method evaluates multiple social disparities using machine learning.
problem Reduction of educational disparities across multiple dimensions.
method Triply-Robust Machine Learning Approach for Causal Decomposition Analysis.
result Simultaneous interventions across multiple domains reduce disparities.
Deep learning predicts synergistic drug combinations from multi-omics data.
problem Predicting effective drug combinations to overcome cancer drug resistance.
method AuDNNsynergy model integrating gene expression, copy number, genetic mutation data and drug properties.
result AuDNNsynergy model outperforms state-of-the-art approaches.
Data mining revealed a cluster of economic, psychological, social and cultural indicators that in combination predicted corruption and wealth of European nations. This prosperity syndrome of self-reliant citizens, efficient division of labor, a sophisticated scientific community, and respect for the law, was clearly di…
Investor flows in Korean equity market transmit shared information, not private signals.
problem Whether investor flows transmit private information or only public signals.
method Transfer Entropy networks constructed from investor-type flows over
umNDates{} trading days.
result Investor flows transmit shared information, not private signals.
In this article, we propose a new algorithm for supervised learning methods, by which one can both capture the non-linearity in data and also find the best subset model. To produce an enhanced subset of the original variables, an ideal selection method should have the potential of adding a supplementary level of regres…
Robust optimization and statistical robustness improve robot navigation policies.
problem Efficiently finding optimal robot navigation policies in uncertain environments.
method Combining robust optimization and statistical robustness with improved Bayesian optimization techniques.
result Safe and repeatable robot navigation policies are achieved with improved robust optimization methods.
Study uses OT to simulate markets, revealing power-law returns are driven by informational effect.
problem Reproduce power-law returns in financial markets using realistic simulations.
method Constructed artificial markets, used optimal transport (OT) to measure similarity, incrementally introduced behavioral components.
result Informational effect of prices is dominant in reproducing power-law returns, and multiple components interact synergistically.
New method uses information theory to uncover causal relationships in complex systems.
problem Discovering causal relationships in multivariate systems, especially in Bayesian networks and hypergraphs.
method Partial Information Decomposition (PID) to explicitly model higher-order interactions.
result PID components reveal direct causal neighbors and collider relationships in Bayesian networks and multi-tail hyperedges in causal hypergraphs.
New method disentangles high-order effects in feature importance.
problem Quantifying cooperative effects in feature importance.
method Adaptive Leave One Covariate Out (LOCO) method to decompose LOCO into two-body and higher-order components.
result Decomposes LOCO into two-body and higher-order components, highlighting synergistic and redundant effects.
Kriformer uses graph transformers to estimate data in sparse sensor areas.
problem Sparse sensor deployment and unreliable data in spatiotemporal kriging tasks.
method Graph transformer model with positional encoding and attention mechanisms.
result Kriformer excels in representing unobserved locations in spatiotemporal kriging tasks.
Mixup improves model accuracy and calibration through data transformation and random perturbation.
problem Improving model accuracy and calibration in machine learning.
method Interprets Mixup as empirical risk minimization with data transformation and random perturbation.
result Mixup induces multiple known regularization schemes that prevent overfitting and overconfident predictions.
Isometry pursuit identifies orthonormal submatrices from wide matrices.
problem Identifying isometric embeddings from wide matrices.
method A convex algorithm combining normalization and multitask basis pursuit.
result The method identifies isometric embeddings from interpretable dictionaries.
CLIM-FS tackles mixed-missing multi-view unsupervised feature selection.
problem Mixed-missing multi-view data with incomplete features and views.
method Integrates imputation of missing views and variables into feature selection model based on nonnegative orthogonal matrix factorization.
result CLIM-FS outperforms state-of-the-art methods on real-world datasets.
Motivated by applications in protein function prediction, we consider a challenging supervised classification setting in which positive labels are scarce and there are no explicit negative labels. The learning algorithm must thus select which unlabeled examples to use as negative training points, possibly ending up wit…
Automates research and development process by evaluating model capabilities.
problem Expanding experimental burden due to reading and verifying research directions.
method Proposes RD2Bench, a benchmark for evaluating data-centric automatic R&D.
result Demonstrates promising potential of LLMs in automating R&D process.
Study compares DL models for medical image segmentation, finds synergistic ensemble strategies improve performance.
problem Improving DL models for specialized medical image segmentation using transfer learning.
method Detailed comparisons of TII and LMI models for binary segmentation of medical images.
result Ensemble strategies improve performance by 10% in certain scenarios.
A new diffusion sampling method combines Krylov subspace and diffusion models for faster and more efficient inverse problems.
problem Efficiently solving large-scale inverse problems in high-performance computing.
method Proposes a novel diffusion sampling strategy that integrates Krylov subspace methods with diffusion models.
result Demonstrates significant speedup (80x faster inference time) and improved reconstruction quality on real-world medical imaging problems.
In the modern healthcare system, rapidly expanding costs/complexity, the growing myriad of treatment options, and exploding information streams that often do not effectively reach the front lines hinder the ability to choose optimal treatment decisions over time. The goal in this paper is to develop a general purpose (…
Study improves drug synergy prediction using ensemble learning.
problem Predicting drug synergy in complex diseases.
method Investigated different compound representations and proposed an ensemble model.
result Ensemble model outperforms baseline models.
Method reconstructs networks and identifies communities from dynamic data.
problem Reconstructing networks and identifying communities from dynamic data.
method Nonparametric Bayesian approach that simultaneously infers network structure and community membership.
result Joint reconstruction and community detection improve each other's accuracy.
Hypersolvers enable fast continuous-depth models for practical applications.
problem Infinite-depth models like Neural ODEs are computationally infeasible for large problems.
method Introducing hypersolvers, neural networks that solve ODEs efficiently with theoretical guarantees.
result Hypersolvers achieve comparable inference time to traditional discrete networks, making continuous-depth models practical.
Model based iterative reconstruction (MBIR) algorithms for low-dose X-ray CT are computationally expensive. To address this problem, we recently proposed a deep convolutional neural network (CNN) for low-dose X-ray CT and won the second place in 2016 AAPM Low-Dose CT Grand Challenge. However, some of the texture were n…
AntMan compresses RNNs for faster inference with minimal accuracy loss.
problem Inference performance, cost, and memory requirements of complex RNN models.
method Structured sparsity combined with low-rank decomposition.
result Up to 100x computation reduction with less than 1pt accuracy drop.
Study shows corporate governance improves stock liquidity with noise traders' participation.
problem Improving liquidity of listed companies' stocks.
method Theoretical model with heterogeneity of investors' beliefs.
result Corporate governance and noise traders' participation synergistically improve stock liquidity.
This dissertation advances scalable Gaussian processes using iterative methods and pathwise conditioning.
problem The classical Gaussian process formulation is not scalable for large datasets and modern hardware.
method Combining iterative methods and pathwise conditioning to improve scalability.
result Significantly reduced memory requirements and facilitated application to larger datasets.
A method for collecting human supervision that combines rules and instance labels.
problem Lack of labeled data and inefficient human supervision.
method Rule-exemplar method with training algorithm for joint denoising and model training.
result Our algorithm is more accurate than existing methods and effectively denoises rules.
ICP separates and competes feature representations to learn diverse information.
problem Learning representations with diversified information.
method Information Competing Process (ICP) separates representations into parts with different mutual information constraints, forcing them to learn independently in a competitive environment.
result ICP facilitates obtaining diversified representations with rich information.
Framework evaluates the impact of prior knowledge in deep learning models.
problem Mitigating data-driven model shortcomings like data dependence and generalization ability.
method Model-agnostic framework inspired by interpretable machine learning, assessing data volume and estimation range effects.
result Complex relationship between data and knowledge, including dependence, synergistic, and substitution effects.
The omnipresence of deep learning architectures such as deep convolutional neural networks (CNN)s is fueled by the synergistic combination of ever-increasing labeled datasets and specialized hardware. Despite the indisputable success, the reliance on huge amounts of labeled data and specialized hardware can be a limiti…
DARL uses DDPMs to generate synthetic market crash scenarios for robust portfolio optimization.
problem Challenges in capturing complex market dynamics and aligning with diverse investor preferences.
method Synergistic integration of DDPMs and DRL for portfolio management.
result DARL outperforms traditional methods in delivering superior risk-adjusted returns and resilience against crises.
A broad spectrum of data from different modalities are generated in the healthcare domain every day, including scalar data (e.g., clinical measures collected at hospitals), tensor data (e.g., neuroimages analyzed by research institutes), graph data (e.g., brain connectivity networks), and sequence data (e.g., digital f…
New method improves autofocus in CBCT scans by 93%.
problem Improper geometry information leads to misplaced signals in CBCT.
method Learning-based motion estimation combined with CBCT consistency constraint.
result Average artifact suppression of 93% achieved.
Hybrid framework merges data and domain knowledge for better spatial interpolation.
problem Spatial interpolation overlooks domain knowledge and limits to spatial coordinates.
method Integrates data-driven features with rule-assisted spatial dependency function mapping.
result Superior performance in two application scenarios, capturing localized features.
We improve kernel ridge regression for skewed responses using oversampling and adaptive partitioning.
problem Kernel ridge regression struggles with skewed response variables, leading to poor estimates.
method Combines adaptive partitioning with oversampling to address skewed responses in kernel ridge regression.
result The proposed method yields estimates with smaller risk compared to classical methods under mild conditions.
Mobile SoCs can improve ML inference by 2x when all components are used concurrently.
problem Power-performance trade-offs in mobile ML inference on heterogeneous SoCs.
method Quantitative evaluation of different ML components on mobile SoCs.
result Mobile SoCs can achieve up to 2x improvement in inference performance by using all components concurrently.
Current deep learning based text classification methods are limited by their ability to achieve fast learning and generalization when the data is scarce. We address this problem by integrating a meta-learning procedure that uses the knowledge learned across many tasks as an inductive bias towards better natural languag…
Proposes a new framework for decomposing information in multivariate settings.
problem Decomposing information from multiple sources about a target variable.
method Formal analogy with set theory and Blackwell order to define PID.
result Framework can be generalized to various information theories.
IFM improves recommender systems by learning flexible feature interactions.
problem Dealing with feature interactions in recommender systems can degrade performance.
method Introduces Interaction-Aware Mechanism (IAM) to learn feature and field interactions.
result Improves performance on two well-known datasets compared to state-of-the-art methods.