Sensitivity Maps improve HSIC for better interpretability and scalability.
problem High computational cost and lack of interpretability in HSIC.
method Introduce Sensitivity Maps (SMs) for HSIC, approximate kernels using random features, and provide convergence bounds.
result RHSIC and SMs efficiently approximate HSIC and provide scalable solutions.
SmoothGrad improves visual clarity of deep network sensitivity maps.
problem Visualizing deep network decision-making processes.
method Introducing SmoothGrad, a method to enhance gradient-based sensitivity maps.
result SmoothGrad helps in creating clearer, more interpretable sensitivity maps.
Improved anti-cancer drug sensitivity prediction using REFINED CNN ensemble learning.
problem Challenges in predicting anti-cancer drug sensitivity for individual cell lines.
method Using REFINED CNN, which represents high-dimensional vectors as compact 2D images with spatial correlations, and building ensembles of these models.
result Ensemble approaches significantly improve drug sensitivity prediction performance compared to single models.
Method differentiates diffusion model training to predict sample sensitivity.
problem Predict how diffusion model samples change with small perturbations.
method Closed-form procedure for computing directional derivatives of the map.
result Estimates sensitivity of diffusion model samples to additive perturbations.
CDAM improves attention maps for ViTs, making them more class-sensitive.
problem Existing attention maps in ViTs lack class sensitivity.
method Class-discriminative attention maps (CDAM) that scale attention scores by class relevance.
result CDAM provides more class-sensitive explanations than existing methods.
Neural framework for conditional OT maps learns from categorical and continuous variables.
problem Learning conditional optimal transport maps between complex distributions.
method Hypernetwork generates adaptive transport layer parameters based on conditioning variables.
result Our method outperforms simpler conditioning methods in comprehensive ablation studies.
We present a novel algorithm (Principal Sensitivity Analysis; PSA) to analyze the knowledge of the classifier obtained from supervised machine learning techniques. In particular, we define principal sensitivity map (PSM) as the direction on the input space to which the trained classifier is most sensitive, and use anal…
Optimizes portfolios by identifying causal drivers of diversification.
problem Achieving efficient portfolio optimization based on asset and diversification dynamics.
method Commonality Principle, Reichenbach Common Cause Principle, conformal maps, Bayesian networks, correlation-based algorithms, neural networks, SDEs.
result Optimal portfolio diversification achieved through causal methodologies and sensitivity forecasting.
Study on measurable pseudo-Anosov maps on surfaces.
problem Characterize dynamics of pseudo-Anosov maps on surfaces.
method Analyze measurable pseudo-Anosov homeomorphisms with specific properties.
result Prove transitivity, dense periodic points, sensitivity, and ergodicity.
Formulates Markov property for risk-sensitive dynamic optimisation.
problem Risk-sensitive dynamic optimisation problems in discrete time.
method Formulates probabilistic Markov property under dynamic risk framework.
result Property holds for standard risk measures and has multiple equivalent versions.
New tool for interpreting neural nets, explaining model behavior.
problem Interpreting neural network responses and explaining model behavior.
method Full-Gradient representation and FullGrad saliency map approximation.
result FullGrad method explains model behavior more comprehensively and accurately than other methods.
Improved saliency maps for deep neural networks with reduced noise.
problem Noisy explanations in Integrated Gradients for deep neural networks.
method SmoothTaylor, adaptive noising, and SmoothGrad techniques.
result SmoothTaylor and adaptive noising generate better quality saliency maps.
Proposes fair mapping to prevent bias in model predictions without distorting data.
problem Reduces bias in model predictions without altering the data distribution.
method Uses Wasserstein GAN and AttGAN frameworks to transform data distributions while preserving privacy and interpretability.
result Preserves data interpretability and fairness in subsequent analysis tasks.
PRESTO maps latent representations across diverse ML models.
problem Understanding variability in latent representations across different ML models.
method Uses persistent homology to characterize latent spaces and measure their pairwise similarity.
result Preserves desirable properties and enables sensitivity analysis of latent representations.
New nonlinear saliency maps improve deep neural network interpretability.
problem Lack of understanding why and how deep neural networks make decisions.
method Developed novel nonlinear saliency maps to better interpret deep neural networks.
result Nonlinear saliency maps provide more specific drivers of classification on complex examples.
The study sets lower bounds on MMSE for inferring sensitive features from noisy data.
problem Estimating sensitive features from noisy observations of correlated features.
method Adversarial evaluation framework based on MMSE estimation with theoretical lower bounds.
result Derives closed-form bounds for linear models, showing optimality in noise variance.
MAPPING debiases GNNs for fair node classification with limited leakage.
problem Graph Neural Networks inherit and exacerbate historical discrimination in high-stake domains.
method MAPPING uses distance covariance-based fairness constraints and adversarial debiasing.
result MAPPING achieves better trade-offs between fairness and utility, mitigating privacy risks.
Local explanations of DNNs are insensitive to parameter values.
problem Sensitivity of local explanations to DNN parameter values.
method Assessed sensitivity of local explanations to DNN parameter values.
result DNNs with randomly-initialized weights produce similar explanations to those with learned weights.
Ensembled neural networks improve MRI image quality.
problem Accelerated parallel MR imaging with high SSIM scores.
method Ensembled Σ-net combining parallel coil and sensitivity networks, trained with supervised and semi-supervised methods. result Ensembling models achieves visually sharp and textured images with robust SSIM scores.
Solves risk-sensitive investment via duality, entropic regularization, and RL.
problem Risk-sensitive portfolio management in a factor-based setting.
method Free energy-entropy duality, Kuroda-Nagai change-of-measure, RL algorithm.
result Direct analytical solution, explicit controls, two interpretations of optimal allocation.
Develops visual explanations for Alzheimer's disease classification using 3D-CNNs.
problem Improving understanding of Alzheimer's disease classification using 3D-CNNs.
method Three approaches: sensitivity analysis and two activation visualization methods.
result Visual explanations identify important brain parts for Alzheimer's disease diagnosis.
Improved differentially private drug sensitivity prediction using compact representations.
problem Challenges in differentially private machine learning with genomic data.
method Representation learning using variational autoencoders, PCA, and random projection.
result Variational autoencoders provide the most accurate predictions for differentially private drug sensitivity prediction.
Paper removes sensitive data from IoT and Big Data for privacy.
problem Privacy concerns in IoT and Big Data.
method Develops new supervised and adversarial learning methods to remove sensitive data.
result Models maintain predictive model utility while making sensitive predictions ineffective.
Attention layers are sensitive to single words, improving generalization over random features.
problem Understanding why attention layers are effective in NLP tasks.
method Study of word sensitivity in random features using BERT-Base word embeddings.
result Attention layers have high word sensitivity, improving generalization over random features.
Two formulae estimate sensitivity of random vectors to distributional parameters.
problem Estimating sensitivity of random vectors to distributional parameters.
method Two analytical formulae and four numerical algorithms.
result Validated numerical algorithms and demonstrated effectiveness.
We introduce a general framework for measuring risk in the context of Markov control processes with risk maps on general Borel spaces that generalize known concepts of risk measures in mathematical finance, operations research and behavioral economics. Within the framework, applying weighted norm spaces to incorporate …
The paper proposes a method to ensure fairness in machine learning models.
problem Ensuring fairness in machine learning models powered by supervised learning.
method Optimal affine transport and Wasserstein-2 barycenter to characterize the Pareto frontier between prediction error and statistical disparity.
result The proposed method effectively balances prediction accuracy and fairness, as demonstrated by numerical simulations.
MOPI optimizes flexible set-valued mappings to achieve superior shape adaptivity in conformal prediction.
problem Challenges in achieving valid conditional coverage in conformal prediction.
method Minimax Optimization Predictive Inference (MOPI) framework that optimizes over a flexible class of set-valued mappings.
result MOPI achieves superior shape adaptivity and maintains a principled connection to mean squared coverage error.
BDeu marginal likelihood score is a popular model selection criterion for selecting a Bayesian network structure based on sample data. This non-informative scoring criterion assigns same score for network structures that encode same independence statements. However, before applying the BDeu score, one must determine a …
This paper proposes an efficient autoHPO method based on data-to-hyper-parameter mapping.
problem Manual hyper-parameter tuning is costly and dependent.
method The approach is based on mapping from data to hyper-parameters using a sophisticated network structure and effective construction algorithms.
result The proposed approach significantly outperforms state-of-the-art methods.
ForestDSH hashes improve nearest neighbor search in high-dimensional data.
problem High-dimensional classification and nearest neighbor search.
method Distribution-sensitive hashing using a forest of decision trees.
result ForestDSH hashes outperform LSH and state-of-the-art methods in speed and accuracy.
New MRI method maps tissue parameters more accurately by ignoring voxel independence.
problem Voxel independence assumption limits model fitting reliability and repeatability.
method Self-supervised deep variational approach with Gaussian mixture prior.
result Our method outperforms current techniques in dMRI simulations and real data.
Learning robust value functions given raw observations and rewards is now possible with model-free and model-based deep reinforcement learning algorithms. There is a third alternative, called Successor Representations (SR), which decomposes the value function into two components -- a reward predictor and a successor ma…
Locality-sensitive hashing converts high-dimensional feature vectors, such as image and speech, into bit arrays and allows high-speed similarity calculation with the Hamming distance. There is a hashing scheme that maps feature vectors to bit arrays depending on the signs of the inner products between feature vectors a…
A new method for computing shape gradients in FSI problems with non-matching meshes.
problem Computing shape gradients in fluid-structure interaction problems with non-matching meshes.
method Partitioned solution procedure using black-box adjoint solvers, augmented target functions, and coupling fields.
result Accurate shape gradients computed with reduced formulations for computational efficiency.
No-collision maps improve manifold learning for image data.
problem Lack of geometric feature sensitivity in traditional distance measures.
method Developed no-collision transportation maps and distances.
result No-collision distances provide isometry for translations and dilations.
The paper learns compact implicit surface maps from streaming data using an ensemble of sparse Gaussian processes.
problem Creating compact and accurate implicit surface maps from streaming range data.
method An ensemble of sparse Gaussian process experts, incrementally adjusted, trades-off between model complexity and prediction error.
result The approach learns compact and accurate implicit surface models comparable to or better than exact GP regression with subsampled data.
Derivative-informed models improve financial surrogates for accurate hedging and risk management.
problem Developing fast surrogate models for financial derivatives and risk quantities.
method Derivative-informed operator learning framework combining neural operators, random features, and tangent sensitivity equations.
result The framework reduces hedging and risk errors by 40-76% compared to standard surrogates.
Certifiable defense method improves robustness of deep learning interpretation.
problem Vulnerability of gradient-based saliency maps to adversarial attacks.
method Sparsified SmoothGrad method, extending certifiably robust smooth classifier bounds.
result Sparsified SmoothGrad method is certifiably robust against adversarial perturbations.
Enhances deep reinforcement learning with object recognition.
problem Few works consider object characteristics in deep reinforcement learning.
method Proposes a novel method to incorporate object recognition into deep reinforcement learning models.
result Shows state-of-the-art results on Atari games.
ProbMinHash improves Jaccard similarity hashing for big data applications.
problem Efficiently estimating set similarities in big data with weighted elements.
method Locality-sensitive hash algorithms that calculate signatures collectively.
result Significantly faster than the original approach, with improved estimation error.
The contour maps of the error of historical resp. parametric estimates for large random portfolios optimized under the risk measure Expected Shortfall (ES) are constructed. Similar maps for the sensitivity of the portfolio weights to small changes in the returns as well as the VaR of the ES-optimized portfolio are also…
Proposes PSCs for UQ in deep nets without retraining.
problem Estimating uncertainty in deep nets with a single pass.
method Identifies sensitive, smooth intermediate layer, fits probabilistic model.
result PSCs achieve UQ and OOD detection performance matching existing methods.
Study optimizes health incentives to balance efficiency and fairness.
problem Designing health incentives to balance efficiency and fairness.
method Inverse behavioral optimization framework integrating QALY-based incentives and adaptive learning.
result Modern health systems operate near an efficiency-saturated frontier, with small fairness adjustments yielding diminishing returns.
CMC method detects causal relationships in time series data.
problem Understanding causal relationships in nonlinear systems.
method Cross-Mapping Coherence method, based on nonlinear state-space reconstruction and coherence metrics.
result CMC accurately identifies causal connections in various systems.
Polynomial chaos surrogates quantify epistemic uncertainty in AI-driven scientific models.
problem Uncertainty in reward estimates hinders interpretability in sequential generative models.
method Fit polynomial chaos expansions to trained models to propagate epistemic uncertainty and quantify sensitivity.
result Interpretable decomposition of reward components driving generative decisions.
An online algorithm improves cPCA for efficient, interpretable data analysis.
problem Efficiently finding informative low-dimensional representations in large datasets.
method Developed an online algorithm for a modified cPCA* method.
result The online algorithm for cPCA* shows improved performance and interpretability.
Diffusion models explained via cognitive science.
problem Weak sensitivity to noise family and noise level scheduling.
method Correspondence with serial reproduction in cognitive science.
result Properties of diffusion models explained by cognitive science.