Deep ROC analysis improves model selection and interpretation in medical and AI applications.
problem Inadequate performance measures for binary classifiers.
method Deep ROC analysis, translating AUC and partial AUC into balanced average accuracy and post-test measures.
result Deep ROC analysis provides balanced average accuracy, average sensitivity, and average specificity.
The Synthetic Minority Oversampling TEchnique (SMOTE) is widely-used for the analysis of imbalanced datasets. It is known that SMOTE frequently over-generalizes the minority class, leading to misclassifications for the majority class, and effecting the overall balance of the model. In this article, we present an approa…
WASH trains ensembles with shuffled weights to improve accuracy and reduce communication.
problem Training ensembles for weight averaging leads to models converging to different loss basins.
method WASH randomly shuffles a small percentage of weights during training to keep models within the same basin.
result WASH achieves state-of-the-art image classification accuracy with lower communication costs.
Proposes a novel neural network method to estimate average treatment effect.
problem Bias in estimating average treatment effect due to confounding and instrumental variables.
method Self-balancing neural network (Sbnet) that estimates pseudo propensity scores and average treatment effect in one step.
result Proposed method outperforms state-of-the-art methods in simulations and real-world datasets.
Accuracies of survival models for life expectancy prediction as well as critical-care applications are significantly compromised due to the sparsity of samples and extreme imbalance between the survival (usually, the majority) and mortality class sizes. While a recent random survival forest (RSF) model overcomes the li…
TKIL improves class-balanced performance in incremental learning.
problem Catastrophic forgetting in sequential learning tasks.
method Introduces Tangent Kernel for Incremental Learning (TKIL) based on Neural Tangent Kernel (NTK).
result TKIL achieves better overall accuracy and variance across classes.
Gaussian and bootstrap methods improve ATE estimator accuracy.
problem Improving the accuracy of Average Treatment Effect (ATE) estimators.
method Gaussian approximation and bootstrap procedures.
result Precise bounds on ATE estimator accuracy quantifying key parameters.
Kernel balancing weights are generalized as KRRR, providing better confidence intervals for treatment effects.
problem Lack of generalization error, correct feature specification, and limited to average effects.
method Interpreting kernel balancing weights as KRRR, relaxing feature specification, and extending Gaussian approximation.
result KRRR provides strong generalization properties and justifies confidence sets for causal functions.
New model reveals balance crucial for robust neural coding.
problem Efficient neural coding in noisy, chaotic networks.
method Analytical model of balanced predictive coding with dissociated balance and weight disorder.
result Superclassical scaling in coding accuracy, independent of balance and weight disorder.
SVM used for estimating treatment effects without confounding.
problem Estimating average treatment effects in the presence of confounding variables.
method Adapts SVM classifier as a kernel-based weighting procedure to balance covariates and estimate causal effects.
result SVM provides a continuous relaxation of the quadratic integer program for balancing covariates and maximizing effective sample size.
Proposes a new framework for balancing average- and worst-case performance in machine learning.
problem Robustness issues in machine learning, especially in safety-critical domains.
method Probabilistic robustness framework that balances average- and worst-case performance.
result Effective algorithm balances average- and worst-case performance with lower computational cost.
Federated learning (FL) is a distributed deep learning method which enables multiple participants, such as mobile phones and IoT devices, to contribute a neural network model while their private training data remains in local devices. This distributed approach is promising in the edge computing system where have a larg…
Improves representation learning for individual treatment effect estimation.
problem Estimating individual treatment effects with high accuracy.
method Introduces a structure keeper to maintain correlation between baseline covariates and representations, trains a discriminator to balance representation and information loss.
result Proposed SMRL algorithm minimizes treatment estimation error and outperforms state-of-the-art methods.
Flashback Learning balances model stability and plasticity in continual learning.
problem Balancing model stability and plasticity in continual learning.
method Flashback Learning (FL) uses a bidirectional regularization approach to balance stability and plasticity.
result FL improves model accuracy by up to 4.91% in Class-Incremental and 3.51% in Task-Incremental settings.
ISP improves DNN uncertainty for better subgroup accuracy.
problem Improving accuracy-group robustness in deep neural networks.
method Introspective Self-play (ISP) adds an introspection task to improve bias-awareness and uncertainty.
result ISP improves the accuracy-group robustness trade-off of AL methods.
Hierarchical GANs reduce anomaly detection costs.
problem Balancing anomaly detection accuracy and sampling costs.
method Hierarchical GANs for nonuniform sampling and buffer zones.
result Proposed GAN-based detector outperforms baseline in detection delay and average cost of error.
Paper explores balancing market dynamics and interpretable forecasting models for energy prices.
problem Tackles the challenge of accurately predicting mFRR price and understanding market dynamics.
method Compares XGBoost and EBM for forecasting mFRR activation price in the balancing market.
result EBM provides comparable forecasting accuracy to XGBoost but with higher interpretability.
Boosts test performance with importance sampling for subpopulation issues.
problem Limited ERM performance on data with spurious correlation or subpopulation.
method Importance sampling as a tool to solve subpopulation problems.
result Achieves state-of-the-art performance on benchmark datasets.
CUBE explains models by balanced experiments and contrasts.
problem Post-hoc explanation of trained predictive models.
method Design-based framework using balanced low-high probes.
result Reveals dominant learned effect structure and clarifies query efficiency.
A new method improves Bayesian deep learning by balancing scalability and accuracy.
problem Scalability issues in Bayesian neural networks.
method Collapsed inference scheme that performs Bayesian model averaging using collapsed samples.
result Significant improvements over existing methods in predictive performance and uncertainty estimation.
Post-calibration improves the accuracy of causal effect estimation.
problem Improperly calibrated propensity scores lead to inaccurate causal effect estimation.
method Performed a simulation study to assess the impact of post-calibration on causal effect estimation.
result Post-calibration reduces the error in estimating the average treatment effect, especially for expressive uncalibrated statistical estimators.
Unified theory for causal inference using various methods.
problem Estimating causal effects in ATE estimation.
method Riesz regression, covariate balancing, DRE, TMLE, matching estimator.
result Unified theory integrating multiple methods for ATE estimation.
Group averaging boosts model accuracy without training cost.
problem Challenging training of equivariant models in physics.
method Group averaging at test time, improving accuracy.
result Improves model accuracy by up to 37% in continuous dynamics.
Deep Reinforcement Learning (deep RL) has made several breakthroughs in recent years in applications ranging from complex control tasks in unmanned vehicles to game playing. Despite their success, deep RL still lacks several important capacities of human intelligence, such as transfer learning, abstraction and interpre…
Improved financial predictions with OHLC data and timestamps.
problem Improving VWAP predictions in financial markets.
method Investigated the impact of timing features on machine learning models for VWAP prediction.
result Incorporating timing features consistently improves predictive performance across multiple ML architectures.
The paper proposes a neural network method to estimate treatment effects by balancing treated and control distributions.
problem Estimating individual and average treatment effects from observational data.
method Balance regularization of multi-head neural network architectures to reduce confounding effects.
result The approach reduces bias-variance trade-off and improves treatment effect estimation.
SurvCaus improves survival CATE estimation using neural nets.
problem Estimating Individual Treatment Effects (ITE) in survival analysis.
method Representation balancing for counterfactual inference with neural networks.
result The proposed method outperforms baseline methods in synthetic and semisynthetic datasets.
Improves VQAs by balancing classical and quantum training resources.
problem Challenges in trainability and resource costs of VQAs on quantum hardware.
method Adopting HELIA Ansatz and combining classical and quantum methods for gradient estimation and training.
result Achieves higher accuracy and success rates in VQE and improved test accuracy in quantum phase classification.
Differentiable model compression adds noise to parameters during training.
problem Model compression for efficient deployment.
method Adding pseudo quantization noise to model parameters during training.
result Compresses model by more than 8x on ImageNet with 0.3% accuracy loss.
Causal trees struggle with accuracy in estimating treatment effects.
problem Estimating heterogeneous causal treatment effects using recursive decision trees.
method Adaptive recursive partitioning with and without sample splitting.
result Causal tree estimators can have uniform-norm errors decreasing more slowly than any power of the sample size.
This paper introduces blind adversarial pruning to balance accuracy, efficiency, and robustness in neural networks.
problem Balancing accuracy, efficiency, and robustness in neural networks with limited resources.
method Adversarial pruning with a cutoff-scale strategy to dynamically adjust the strength of adversarial examples.
result Blind adversarial pruning improves the overall AER of pruned models compared to adversarial pruning.
Paper proposes a new method for estimating treatment effects using interpretable deep learning models.
problem Estimating treatment effects from observational data with interpretability.
method Proposes a novel objective function using energy distance balancing score and neural additive models for improved interpretability.
result Demonstrates superior performance over state-of-the-art methods in semi-synthetic experiments.
This paper proposes BAT to balance accuracy and robustness in adversarial training.
problem Balancing accuracy and robustness in adversarial training models.
method Blind adversarial training (BAT) uses a cutoff-scale strategy to adaptively estimate a nonuniform budget for AEs.
result BAT improves the overall robustness of adversarial training models.
FairACE improves fairness in GNNs by balancing node performance across degree groups.
problem Degree biases in GNNs lead to unequal prediction performance among nodes with varying degrees.
method Integrates asymmetric contrastive learning with adversarial training to balance performance between high-degree and low-degree nodes.
result Significantly improves degree fairness metrics while maintaining competitive accuracy.
VarPro selects features without model dependence, achieving balanced performance.
problem Finding a small set of features with high explanatory power.
method Rule-based variable priority approach, avoiding model-specific methods and artificial data.
result VarPro has a consistent filtering property for noise variables and achieves balanced performance.
We study the problem of off-policy policy evaluation (OPPE) in RL. In contrast to prior work, we consider how to estimate both the individual policy value and average policy value accurately. We draw inspiration from recent work in causal reasoning, and propose a new finite sample generalization error bound for value e…
Proposes a new method for deep ensembles that improves accuracy and calibration.
problem Improving accuracy and calibration of deep ensembles.
method Estimates confusion matrices of ensemble members and weighs them according to their inferred performance.
result Empirically shows superiority of soft Dawid Skene over ensemble averaging.
New algorithm improves causal effect estimation for continuous treatments.
problem Observational causal inference with continuous treatments.
method End-to-end entropy balancing for maximizing causal inference accuracy.
result Our algorithm estimates causal effect more accurately than baseline.
BI-MAML learns multiple tasks without forgetting old ones.
problem Catastrophic forgetting in meta learning.
method Incremental model adaptation with balanced learning strategy.
result BI-MAML outperforms state-of-the-art models in accuracy and efficiency.
Most state-of-the-art graph kernels only take local graph properties into account, i.e., the kernel is computed with regard to properties of the neighborhood of vertices or other small substructures. On the other hand, kernels that do take global graph propertiesinto account may not scale well to large graph databases.…
Dynamic CBDT improves treatment effect estimation in clinical data.
problem Estimating heterogeneous treatment effects in observational data with high accuracy and interpretability.
method Dynamic Regularized Causal Boosted Decision Trees (CBDT) integrating variance regularization and calibration.
result Significantly improved estimation accuracy and reliable coverage of true treatment effects.
Softens tilings in 3D space, proving conjectures about polyhedral tilings.
problem Proving that all locally polyhedral tilings in 3D space can be softened.
method Developed a new edge-bending algorithm to prove the statement.
result Proved conjectures about polyhedral tilings in 3D space and the plane.
Epilepsy is a neurological disorder classified as the second most serious neurological disease known to humanity, after stroke. Localization of the epileptogenic zone is an important step for epileptic patient treatment, which starts with epileptic spike detection. The common practice for spike detection of brain signa…
LDA-XGB1 balances fairness and accuracy in lending models.
problem Fair lending practices and model interpretability in binary classification.
method Biobjective optimization using binning and information value, leveraging XGBoost.
result Achieves effective balance between accuracy, fairness, and interpretability.
Tail averaging consists in averaging the last examples in a stream. Common techniques either have a memory requirement which grows with the number of samples to average, are not available at every timestep or do not accomodate growing windows. We propose two techniques with a low constant memory cost that perform tail …
In modern portfolio theory, the balancing of expected returns on investments against uncertainties in those returns is aided by the use of utility functions. The Kelly criterion offers another approach, rooted in information theory, that always implies logarithmic utility. The two approaches seem incompatible, too loos…
Optimizes glmnet configuration for better accuracy and efficiency.
problem Inappropriate glmnet configuration leads to inaccurate solutions and increased computation time.
method Data-driven framework using neural networks to predict accuracy and computation time from dataset characteristics and configuration.
result Automatic selection of optimal configuration maximizing accuracy under a time constraint.
Most systems and learning algorithms optimize average performance or average loss -- one reason being computational complexity. However, many objectives of practical interest are more complex than simply average loss. This arises, for example, when balancing performance or loss with fairness across people. We prove tha…