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.
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.
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.
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.
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.
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.
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.
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…
Combining self-training and contrastive learning improves performance under distribution shift.
problem Improving performance under distribution shift using unlabeled data.
method Combining self-training and contrastive learning techniques.
result Combined method achieves 3-8% higher accuracy than either approach independently.
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.
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…
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.
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.
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.
A hybrid method combines model-based and data-driven approaches for multiscale constitutive responses.
problem High computational costs and inaccuracies in nonlinear multiscale methods.
method Hybrid methodology combining model-based constitutive laws, data-driven corrections, and computational multiscale approaches.
result Model-data-driven approach improves macroscale simulations with similar accuracy and computational cost.
MISA combines multiple datasets for better feature extraction.
problem Combining diverse datasets for better feature extraction.
method MISA combines multiple heterogeneous datasets using Kotz distribution and combinatorial optimization.
result MISA produces robust generalization of ICA, IVA, and ISA.
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…
SAMI learns disentangled representations from data.
problem Learning disentangled representations from data.
method Combines diffusion models and VAEs to learn disentangled representations.
result SAMI learns disentangled representations that are interpretable and useful.
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.
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…
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.
Purpose: To introduce a combined machine learning (ML) and physics-based image reconstruction framework that enables navigator-free, highly accelerated multishot echo planar imaging (msEPI), and demonstrate its application in high-resolution structural and diffusion imaging. Methods: Singleshot EPI is an efficient enco…
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.
Improved inference via combining Rényi divergence and rejection sampling.
problem Efficiently approximate complex distributions in inference problems.
method Synergistic combination of Rényi α-divergence variational inference and rejection sampling.
result Two-stage hybrid inference algorithm yields more accurate approximations.
POLO framework enables efficient learning and exploration in model-based control.
problem Efficient learning and exploration in model-based control settings.
method Combines local model-based control, global value function learning, and exploration.
result POLO framework accelerates value function learning and enables better policies.
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.
Dynamic treatment recommendation systems based on large-scale electronic health records (EHRs) become a key to successfully improve practical clinical outcomes. Prior relevant studies recommend treatments either use supervised learning (e.g. matching the indicator signal which denotes doctor prescriptions), or reinforc…
Paper proposes a method for efficient online classification using siamese networks and active learning.
problem Online learning challenges with limited, nonstationary, and imbalanced data.
method Synergistic combination of siamese neural networks and active learning with multi-sliding window approach.
result Significantly outperforms baselines and state-of-the-art algorithms in terms of learning speed and performance.
Study examines market reactions and spillovers in Japanese bank mergers using multiple methods.
problem Understanding valuation and spillover effects of bank mergers in the Japanese banking sector.
method Combines event study, VAR models, IRFs, and PSM to analyze two M&A events.
result Significant positive market reaction and prolonged positive spillovers detected.
SMI uses mixture models to improve SVGD's performance in Bayesian inference.
problem Variance collapse in SVGD for Bayesian inference, especially with small models.
method Generalizes SVGD to Stein mixture models, optimizing an ELBO lower bound.
result SMI avoids variance collapse and accurately estimates uncertainty for small BNNs.
PIML model improves hydrological predictions by blending physics and ML.
problem Hydrological models either lack predictive accuracy or fail to maintain physical consistency.
method Physics Informed Machine Learning (PIML) that integrates physics-based models and ML algorithms.
result PIML model outperforms both physics-based and ML models in predicting streamflow and evapotranspiration.
The paper introduces new processors for fair credit scoring.
problem Fairness in credit scoring with multiple sensitive variables.
method Logical processors (LP) and Multistage processors (MP).
result Logical processors are effective for handling multiple sensitive variables.
RiskMiner discovers formulaic alphas using MCTS for better performance.
problem Mining formulaic alphas without considering structural information and alpha correlations.
method Formulates alpha mining as an MDP and solves it with a risk-seeking MCTS.
result Our method outperforms state-of-the-art benchmarks and achieves the most profitable results.
NDI enables high-quality QSM without parameter tuning.
problem Quantitative Susceptibility Mapping (QSM) with regularization tuning issues.
method Nonlinear Dipole Inversion (NDI) using a physics-based forward model and a Variational Network (VN).
result NDI achieves high-quality QSM from as few as 2-direction data.
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.
CCDF reduces diffusion sampling steps for inverse problems.
problem Slow sampling from diffusion models in inverse problems.
method Starting from a single forward diffusion step with better initialization, followed by stochastic contraction.
result Significantly reduced sampling steps for state-of-the-art reconstruction.
Two-stage framework detects multi-modal outliers.
problem Detecting outliers in multi-modal data structures.
method Combines global kernel PCA and local clustering stages.
result Significantly outperforms existing methods on challenging datasets.
GNN-CL model improves financial fraud detection using graph neural networks and reinforcement learning.
problem Complex financial fraud detection with high false positive rates.
method Combines GNN, CNN, LSTM, and MLPS to analyze transaction patterns and uses reinforcement learning to filter out noise.
result GNN-CL outperforms existing methods in financial fraud detection, reducing false positives.
New method tackles video inverse problems using image diffusion models.
problem Spatio-temporal degradation in video inverse problems.
method Leverages image diffusion models to treat time dimension as batch dimension, introduces batch-consistent diffusion sampling.
result Achieves state-of-the-art reconstructions for various spatio-temporal degradations.
The identification of sources of advection-diffusion transport is based usually on solving complex ill-posed inverse models against the available state- variable data records. However, if there are several sources with different locations and strengths, the data records represent mixtures rather than the separate influ…
SALT combines geometric and model-based alignment for domain adaptation.
problem Aligning source and target domains for unsupervised domain adaptation.
method SALT treats alignment as an auxiliary task, leveraging subspace geometry and gradient-based optimization.
result SALT achieves comparable or better performance than state-of-the-art methods.