Proposes a new method to interpret EEG classification models without needing a baseline.
problem Reliable interpretation of EEG classification models using integrated gradients.
method Compensated Integrated Gradients using Shapley sampling.
result The proposed method provides more reliable attributions than original integrated gradients.
New robustness attacks improve evaluation of neural networks.
problem Difficulty in evaluating robustness of neural networks.
method Gradient-based adversarial attacks that are more reliable and efficient.
result Developed attacks are more reliable and efficient than existing methods.
New method combines neural networks with Monte Carlo for complex system reliability.
problem Estimating small failure probabilities in complex systems.
method Subset Simulation with Hamiltonian Neural Networks.
result High acceptance rates and computational efficiency in low-probability regions.
Paper optimizes neural network layers to reduce energy usage without sacrificing accuracy.
problem Energy consumption in deep neural networks during inference.
method Layerwise noise maximization to optimize reliability of memory elements.
result Reduces memory energy consumption by 3.3 times at equal accuracy.
Algorithm ensures safe optimization under unknown constraints.
problem Optimization under unknown safety constraints.
method Reliable Frank-Wolfe (Reliable-FW) algorithm for non-convex functions.
result Algorithm finds approximate first-order stationary points safely.
Two BO methods improve reliability optimization for rare failures.
problem Maximizing reliability of designs subject to random perturbations.
method Bayesian optimization with Thompson sampling and knowledge gradient.
result Proposed methods outperform existing techniques in extreme failure probability scenarios.
Enhanced visual feature attribution via adaptive baseline weighting.
problem IG's sensitivity to baseline images leads to noisy or unstable explanations.
method Weighted Integrated Gradients (WG) evaluates and weights baselines for improved reliability.
result WG improves over Expected Gradients (EG) by up to 36% across various models.
Gradient Boosted Feature Selection (GBFS) selects features reliably and scales well.
problem Feature selection in complex datasets.
method Gradient Boosted Trees modification.
result GBFS outperforms other feature selection algorithms on real-world data.
Proposes glocal hypergradient estimation for hyperparameter optimization.
problem Combining reliability and efficiency in hyperparameter optimization.
method Uses Koopman operator theory to approximate global hypergradients from local ones.
result Achieves both reliability and efficiency in hyperparameter optimization.
New framework tackles high-dimensional reliability analysis using surrogate models and active subspaces.
problem High computational cost and curse of dimensionality in reliability analysis of high-dimensional systems.
method Sparse Active Subspace (SAS) algorithm for identifying low-dimensional manifolds and constructing efficient surrogate models.
result Proposed framework significantly improves accuracy and efficiency of reliability analysis compared to existing methods.
New metric assesses reliability of AI explanations.
problem Unreliable AI explanations under realistic conditions.
method Explanation Reliability Index (ERI) metrics quantifying stability under four axioms.
result Widespread reliability failures in popular explanation methods.
The paper explores how Lipschitz-continuity improves GAN training stability and quality.
problem Failure and instability in GAN training due to unreliable gradient from optimal discriminative function.
method Investigates the property of optimal discriminative function and proves Lipschitz-continuity is a solution.
result Lipschitz-continuity condition ensures convergence and leads to more stable and higher quality generated samples.
New method calculates sensitivity of system failure probability.
problem Difficulty in computing sensitivity of failure probability.
method Monte Carlo strategy using response gradient and kernel smoothing.
result Single Monte Carlo run for sensitivity estimates.
RUE audits machine learning predictions for reliability.
problem Ensuring trust in machine learning models for high-stakes applications.
method Resampling uncertainty estimation (RUE) algorithm to audit model reliability after training.
result RUE more effectively detects inaccurate predictions than existing tools.
The paper provides a uniform convergence bound for smooth calibration error and its relationship with functional gradient.
problem Limited theoretical understanding of learning algorithms achieving high accuracy and good calibration.
method Focuses on smooth calibration error, providing a uniform convergence bound and proving the relationship with functional gradient.
result Derives conditions for simultaneous classification and calibration guarantees in gradient boosting trees, kernel boosting, and neural networks.
New method improves accuracy in computing implied volatility.
problem Computing implied volatility from the Black-Scholes model.
method Adaptive gradient descent optimizers for numerical computation.
result More accurate results compared to close form approximation and Newton-Raphson method.
BayesAdapter turns pre-trained NNs into reliable BNNs with minimal overhead.
problem Scalability, accessibility, and reliability of Bayesian neural networks.
method Bayesian fine-tuning of pre-trained deterministic NNs to variational BNNs.
result BayesAdapter produces more reliable posteriors with less training overhead.
Stochastic gradient descent outperforms traditional force-directed methods.
problem Improving graph layout quality and efficiency.
method Applying stochastic gradient descent for stress minimization.
result Stochastic gradient descent is simpler and more robust than traditional methods.
Ask-n-Learn uses gradient embeddings for active learning in image classification.
problem Efficiently labeling large amounts of training data for deep models.
method Gradient embeddings based on pseudo-labels, prediction calibration, and data augmentation.
result Significant improvements over state-of-the-art baselines on image classification tasks.
The policy gradient approach is a flexible and powerful reinforcement learning method particularly for problems with continuous actions such as robot control. A common challenge in this scenario is how to reduce the variance of policy gradient estimates for reliable policy updates. In this paper, we combine the followi…
CCI combines Bayesian and gradient boosting to create fair, reliable credit risk scores.
problem Tackles high-stakes lending decisions with changing data distributions and fairness constraints.
method Combines Bayesian neural risk scorer and fairness-constrained gradient boosting with shift-aware fusion.
result CCI achieves best trade-off between discrimination, calibration, stability, and fairness.
Bayesian Federated Learning improves model reliability in dynamic environments.
problem Uncertainty quantification and robust adaptation in distributed learning.
method Proposes a continual BFL framework using SGLD for sequential updates and continual learning challenges.
result Continual Bayesian updates preserve knowledge and adapt to evolving data.
G-Sim uses LLMs to build reliable simulators for complex systems.
problem Building robust simulators for critical domains like healthcare and logistics is challenging.
method Hybrid framework combining LLM-driven structural design and empirical calibration.
result G-Sim produces reliable, causally-informed simulators that handle non-differentiable and stochastic simulators.
Bayesian methods enhance deep learning models by improving reliability and uncertainty.
problem Improving reliability and uncertainty awareness in deep learning models.
method Approximate Bayesian inference techniques, including SG-MCMC and VI, applied to deep learning models.
result Enhanced posterior inference for deep learning models, particularly in neural networks and generative models.
Foundation models improve time series prediction reliability, especially with limited data.
problem Improving time series prediction reliability with limited data.
method Comparison of Time Series Foundation Models (TSFMs) with traditional methods in conformal prediction.
result TSFMs provide more reliable conformalized prediction intervals and more stable calibration with limited data.
The aim of the present paper is to develop a strategy for solving reliability-based design optimization (RBDO) problems that remains applicable when the performance models are expensive to evaluate. Starting with the premise that simulation-based approaches are not affordable for such problems, and that the most-probab…
In this paper we study the problem of recovering a structured but unknown parameter θ ∗ {\bfθ}^* θ ∗ from n n n nonlinear observations of the form y i = f ( ⟨ x i , θ ∗ ⟩ ) y_i=f(\langle {\bf{x}}_i,{\bfθ}^*\rangle) y i = f (⟨ x i , θ ∗ ⟩) for i = 1 , 2 , … , n i=1,2,\ldots,n i = 1 , 2 , … , n . We develop a framework for characterizing time-data tradeoffs for a variety of parameter estimation algorithms when…
Paper proposes MUCS for more reliable TDA in diffusion models.
problem Current TDA approaches lack reliability and robustness.
method Mirrored unlearning and noise-consistent skew (MUCS).
result MUCS outperforms existing methods on three datasets.
Improves reinforcement learning by combining off-policy data and exploration.
problem Data inefficiency and local optima in policy gradient methods.
method Combines off-policy data reuse, exploration, and deterministic policies with stochastic optimization.
result Successfully learns solutions using fewer interactions than standard methods.
In this paper we propose a novel gradient algorithm to learn a policy from an expert's observed behavior assuming that the expert behaves optimally with respect to some unknown reward function of a Markovian Decision Problem. The algorithm's aim is to find a reward function such that the resulting optimal policy matche…
New sparsity operator reduces variance reduction methods' computational cost.
problem Reduce computational cost of variance reduction methods.
method Introduce random-top-k operator to estimate gradient sparsity and reduce operations per update.
result Our algorithm consistently outperforms SpiderBoost in various tasks.
Improved DLG extracts accurate labels from gradients, overcoming DLG's convergence issues.
problem Private training data leakage from shared gradients in distributed learning systems.
method Proposes iDLG, a simple approach to synthesize accurate labels from gradients.
result iDLG reliably extracts ground-truth labels from gradients, unlike DLG.
XGBoost outperforms other boosting techniques in training speed and generalization performance.
problem Comparing XGBoost with other boosting techniques.
method Comprehensive comparison of XGBoost, random forests, and gradient boosting using tuned and default models.
result XGBoost is not always the best choice under all circumstances.
New recommendations improve Gaussian process accuracy and stability.
problem Numerical instabilities and poor test likelihoods in iterative Gaussian process learning.
method Investigated CG tolerance, preconditioner rank, and Lanczos decomposition rank. Recommended small CG tolerance and large root decomposition size.
result L-BFGS-B optimizer achieves convergence with fewer gradient updates, improving Gaussian process accuracy.
ENTMOOT integrates tree models for better decision-making and optimization.
problem Difficult optimization of tree models and lack of reliable uncertainty measures.
method Integrates already trained tree models into optimization problems with a reliable uncertainty measure.
result Proves globally optimal solutions for optimization problems.
DGPs with variational inference suffer from SNR issues that degrade gradient estimates, leading to unreliable training.
problem SNR issues in gradient estimates for DGPs with variational inference.
method Adapted doubly reparameterized gradient estimators for DGP training.
result Fix improves predictive performance of DGP models.
A new algorithm solves sparse optimization problems on measures efficiently.
problem Sparse optimization problems on measures.
method Over-parameterized Stochastic Gradient Descent with Random Features.
result Global convergence with rate O ( log ( K ) / K ) O(\log(K)/\sqrt{K}) O ( log ( K ) / K ) and bounded total variation norms. DG improves policy gradient efficiency by selectively backpropagating only valuable samples.
problem Expensive backward passes in policy gradient methods reduce efficiency.
method Introduces 'delight' as a forward-pass signal of learning value and a Kondo gate to selectively backpropagate.
result Selective backpropagation reduces backward pass costs without sacrificing learning quality.
BadGD identifies gradient descent vulnerabilities through strategic backdoor attacks.
problem Gradient descent vulnerabilities through malicious data manipulation.
method Introduces Max RiskWarp, Max GradWarp, and Max GradDistWarp triggers to exploit gradient descent.
result Demonstrates how malicious triggers can significantly alter loss landscapes and gradient calculations.
Adapts IG for better feature attributions and robustness.
problem Reliability concerns in feature attributions for deep learning models.
method Adaptation of path-based feature attribution to Riemannian geometry of data manifolds.
result IG along geodesics generates more intuitive and robust explanations.
LDA-GO improves LDA for high-dimensional data via gradient optimization.
problem LDA struggles in high-dimensional settings due to unreliable covariance matrix estimation.
method LDA-GO learns a low-rank precision matrix via gradient optimization, automatically selecting between Gaussian likelihood and cross-entropy loss.
result LDA-GO outperforms other LDA variants in sparse-signal high-dimensional regimes.
Leveraging advances in variational inference, we propose to enhance recurrent neural networks with latent variables, resulting in Stochastic Recurrent Networks (STORNs). The model i) can be trained with stochastic gradient methods, ii) allows structured and multi-modal conditionals at each time step, iii) features a re…
A new loss function improves reinforcement learning convergence.
problem Value function learning algorithms often fail to converge reliably.
method Proposes a novel kernel loss function for Bellman equation.
result The proposed loss function avoids divergence and works reliably.
Paper proposes B3D method for black-box backdoor detection.
problem Detecting backdoor attacks in black-box models without access to training data.
method Gradient-free optimization to reverse-engineer triggers, simple strategy for reliable predictions.
result Effectiveness of B3D method corroborated on hundreds of DNN models.
DP-BNNs improve accuracy, privacy, and reliability in neural networks.
problem Balancing privacy and accuracy in neural networks.
method Proposed three DP-BNNs: DP-SGLD, DP-BBP, and DP-MC Dropout.
result DP-SGLD achieves high accuracy under strong privacy guarantees.
Study evaluates deep learning models for solar flare prediction with interpretability analysis.
problem Lack of interpretability in deep learning models for solar flare prediction.
method Proximity-based metric for analyzing attribution maps generated by Guided Grad-CAM.
result Models' predictions align with active region characteristics, offering insights into their behavior.
The paper studies efficient Hessian fitting methods for stochastic optimization.
problem Efficient Hessian fitting for stochastic optimization.
method Preconditioned Stochastic Gradient Descent (PSGD) method and Lie groups.
result Hessian fitting problem is strongly convex in certain Lie groups.
Paper proposes ZO-NGD for more efficient black-box attacks.
problem Vulnerability of state-of-the-art DNNs to adversarial attacks.
method Zeroth-order natural gradient descent (ZO-NGD) for black-box attacks.
result ZO-NGD achieves significantly lower model query complexities.