Study parameter sensitivities in bond pricing models with jumps.
problem Analyzing the impact of parameters on bond pricing models with jumps.
method Theoretical analysis and MATLAB simulations of a Brownian motion and compound Poisson process.
result Explicit call price formula and verification of sensitivities.
A new method sparsifies neural networks by reducing sensitive parameters to zero.
problem Challenges of memory-limited applications due to large number of neural network parameters.
method Quantifies output sensitivity, introduces a regularization term to gradually reduce sensitive parameters.
result Surpasses most recent techniques in sparsity and error rates, achieving twice the sparsity at equal error rates in some cases.
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.
SSRCA simplifies ABM sensitivity analysis using machine learning.
problem Hardness of performing sensitivity analysis for complex ABMs.
method Machine learning pipeline (Simulate, Summarize, Reduce, Cluster, Analyze) for ABMs.
result SSRCA identifies sensitive parameters and common output patterns for ABMs.
Adjoint SA speeds up bioprocess parameter learning.
problem Challenges in digital twin development for biomanufacturing.
method Adjoint sensitivity analysis on multi-scale enzymatic reaction networks.
result Resilient sensitivities reveal bioprocess regulatory mechanisms.
SeReNe prunes neurons with low sensitivity to reduce network size.
problem Large neural networks consume too many resources on resource-constrained devices.
method Exploits neural sensitivity as a regularizer to prune neurons with low sensitivity.
result Pruning neurons with low sensitivity achieves competitive compression ratios.
The paper analyzes robustness and sensitivity of rough Volterra stochastic volatility models.
problem Analyzing the robustness and sensitivity of stochastic volatility models.
method Statistical tests and empirical analysis on Apple Inc. equity options.
result Comparison of different models' robustness and sensitivity to option data structure.
Proposes ML methods for robust price-sensitivity estimation in dynamic pricing.
problem Estimating price elasticities robustly in the presence of feature-dependent sensitivity.
method Poisson semi-parametric model with two-stage estimation: first-stage ML for observed purchases, second-stage Bayesian GLM for price-sensitivity.
result Reduces estimation error in price-sensitivity parameters from 25% to 4%.
We address the problem of parameter estimation in models of systems biology from noisy observations. The models we consider are characterized by simultaneous deterministic nonlinear differential equations whose parameters are either taken from in vitro experiments, or are hand-tuned during the model development process…
Study validates SV models with jump component and long memory parameter, using robustness and sensitivity analysis.
problem Validation of SV models with jump component and long memory parameter.
method Robustness and sensitivity analysis using bootstrapping and Monte-Carlo filtering on market data.
result Validation of SV models with jump component and long memory parameter.
Proposes a method to assess unobserved confounding effects in causal inference.
problem Assessing unobserved confounding in causal inference studies.
method Copula-based normalizing flows with sensitivity parameter ρ. result Estimates average causal effect (ACE) as a function of unobserved confounding strength.
Paper analyzes CCT sensitivity in constrained power systems, offering insights into system stability and parameter changes.
problem Identifying preventive control measures to avoid large generation losses during disturbances.
method Derived first-order CCT sensitivity for generic constrained power systems using trajectory sensitivity computation.
result Sensitivity of CCT to system parameters, providing insights into feasibility and stability.
New method tackles catastrophic forgetting and order-sensitivity in continual learning.
problem Catastrophic forgetting and order-sensitivity in continual learning.
method Additive Parameter Decomposition (APD) to represent task parameters as a sum of shared and adaptive parts.
result Significantly outperforms state-of-the-art methods in accuracy, scalability, and order-robustness.
A method to assess sensitivity to unmeasured confounding with sharp bounds.
problem Assessing the impact of unmeasured confounding on causal effects.
method Sets two intuitive parameters to estimate sensitivity intervals.
result Bounds on true causal effects can be tighter than existing methods.
Proposes a differentially private bandit algorithm reducing noise over time.
problem Privacy concerns in interactive recommendation systems.
method Tree-based mechanism to add Laplace or Gaussian noise to model parameters, focusing on dynamic global sensitivity.
result Demonstrates (ε,δ)-differential privacy with reduced noise and improved regret. Paper improves robustness of GNNs against adversarial attacks.
problem Understanding robust generalization of GNNs in adversarial settings.
method Develops a sensitivity-aware PAC-Bayesian framework for MPGNNs.
result Derives tighter robust generalization bounds for MPGNNs.
Study on function sensitivity in random DNNs using large deviation theory.
problem Understanding function sensitivity in finite-size deep neural networks.
method Large deviation theory and path integral analysis applied to random DNNs with ReLU and sign activations.
result Random DNNs with ReLU activations are more robust to parameter perturbations.
The study assesses sensitivity to prior choices in Bayesian nonparametric models.
problem Difficulty in specifying priors for Bayesian nonparametric models.
method Utilizes variational Bayesian methods to assess sensitivity to concentration parameter and stick-breaking distribution.
result Demonstrates how to evaluate sensitivity to prior choices in Dirichlet process mixtures and related models.
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 examine the issue of sensitivity with respect to model parameters for the problem of utility maximization from final wealth in an incomplete Samuelson model and mainly, but not exclusively, for utility functions of positive power-type. The method consists in moving the parameters through change of measure, which we …
Bayesian approach improves AdaLoRA's performance and efficiency.
problem Improving the efficiency and performance of adaptive low-rank adaptation.
method Utilized Bayesian metrics and the Improved Variational Online Newton (IVON) optimizer for adaptive parameter budget allocation.
result Bayesian counterpart outperforms sensitivity-based importance metric and is faster than AdaLoRA.
We develop a method for quantile-based sensitivity analysis in models with discontinuities.
problem Uncertainty in interpreting discontinuous models using traditional derivatives.
method Quantile-based derivatives for discontinuous models with discrete inputs.
result Derivatives of quantile-based outputs are well-defined and provide meaningful insights.
Diffusion models accurately recover mixture weights from generated samples despite score function insensitivity.
problem Score-based generative models often fail to learn correct relative mode amplitudes (mixture weights) from generated samples.
method Relate diffusion score matching (DSM) loss to mixture weight estimation error, define diffusion score sensitivity index (DSSI), and prove its governing role in mixture weight recovery.
result Generated samples can accurately recover mixture weights from the DSM loss, even when the target score is insensitive to mixture weights.
Proposes ρ-GNF for sensitivity analysis of unobserved confounding.
problem Sensitivity analysis of unobserved confounding in observational studies.
method Copulas and normalizing flows to estimate average causal effect (ACE) as a function of unobserved confounding strength.
result Develops ρcurve to provide bounds for ACE and identify confounding strength required to nullify ACE. We propose a cloud-based filter trained to block third parties from uploading privacy-sensitive images of others to online social media. The proposed filter uses Distributed One-Class Learning, which decomposes the cloud-based filter into multiple one-class classifiers. Each one-class classifier captures the properties…
The paper develops methods to analyze sensitivity in stochastic models using surrogate models.
problem Quantifying the impact of input variability on stochastic simulators with randomness.
method The authors propose using generalized lambda models to emulate response distributions of stochastic simulators and estimate sensitivity indices.
result The proposed method can estimate sensitivity indices even with strong heteroskedasticity and small signal-to-noise ratio.
Linking output sensitivity to deep learning generalization.
problem Understanding and comparing the generalization properties of deep neural networks.
method Linking the loss function to output sensitivity and analyzing its relation to bias-variance decomposition.
result Output sensitivity is a strong metric for comparing generalization performance of deep networks.
Framework for sensitivity analysis in biomanufacturing processes.
problem High complexity and uncertainty in biomanufacturing processes.
method Shapley value estimation for linear and nonlinear pKG models, using quasi-Monte Carlo and antithetic sampling.
result Improved efficiency and accuracy in sensitivity analysis for biomanufacturing processes.
Paper introduces RCaI, a risk-sensitive control method using Rényi divergence.
problem Risk-sensitive control in reinforcement learning.
method RCaI extends CaI using Rényi divergence variational inference.
result Risk-sensitive optimal policy can be obtained by solving a soft Bellman equation.
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.
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 …
Develops a risk-sensitive reinforcement learning framework for uncertain environments.
problem Learning in uncertain environments with varying risk preferences.
method Integrates utility functions and risk measures into reinforcement learning, tuning risk preference with parameter β.
result Risk-averse, risk-neutral, and risk-taking behaviors can be achieved and compared.
Deep networks infer parameters for chaotic dynamics in climate models.
problem Uncertainty in climate sensitivity due to coarse model resolution.
method Three deep network algorithms (fully-connected, 1D, 2D convolutional) trained on Lorenz-96 model.
result Convolutional networks outperform fully-connected and 1D networks in parameter recovery.
This paper adresses the general issue of estimating the sensitivity of the expectation of a random variable with respect to a parameter characterizing its evolution. In finance for example, the sensitivities of the price of a contingent claim are called the Greeks. A new way of estimating the Greeks has been recently i…
Gradient descent with large steps leads to chaotic parameter space and unpredictable outcomes.
problem Understanding the behavior of gradient descent with large step sizes in matrix factorization.
method Analyzing the fractal structure of the parameter space and deriving critical step sizes for convergence.
result Gradient descent with large steps exhibits chaotic behavior and sensitivity to initialization, creating a fractal boundary between converging and diverging minimizers.
This study prioritizes temporal resolution over spatial in energy systems models due to higher influence.
problem The impact of spatial and temporal resolution on energy system models.
method Global sensitivity analysis to compare structural aspects, spatial, and temporal resolution.
result Temporal resolution has a higher influence on all results parameters compared to spatial resolution.
Paper introduces a new method for risk-sensitive investment management using RL.
problem Risk-sensitive portfolio management with unknown model parameters.
method Combines RL and risk-sensitive stochastic control with Gaussian perturbations for exploration.
result Endogenous relative-entropy regularization and optimal investment strategy derived.
OPNP prunes parameters and neurons to improve OOD detection without training.
problem Detecting out-of-distribution samples in real-world machine learning models.
method OPNP approach that identifies and removes sensitive parameters and neurons.
result OPNP consistently outperforms existing methods on multiple OOD detection tasks.
PCA minor projection is most sensitive to distributional changes in bivariate data.
problem Detecting sparse distributional changes in high-dimensional data.
method Proved that the minor projection of PCA-rotated data is most sensitive to distributional changes defined by Hellinger distance.
result The minor projection is the most sensitive to sparse distributional changes in high-dimensional data.
Novel method measures DNN sensitivity to perturbations.
problem Vulnerability of DNNs to adversarial examples.
method Perturbation manifold and influence measure.
result Demonstrated usefulness for model building tasks.
DALTON improves ODE parameter estimation by learning from noisy data.
problem High sensitivity to parameters in ODEs produces unreliable parameter estimates.
method Data-adaptive probabilistic likelihood approximation for ODEs.
result DALTON produces more accurate parameter estimates than existing methods.
Sharp bounds on ATE with unmeasured confounders, valid even when misspecified.
problem Bounding average treatment effects with unmeasured confounders.
method Distributionally robust optimization, double sharpness, double validity.
result Proposes estimators with robustness properties for valid bounds.
Study benchmarks RL algorithms on real robots, revealing their performance and hyper-parameter sensitivity.
problem Lack of benchmark tasks and source code for reinforcement learning on physical robots.
method Introduced benchmark tasks with multiple robots, tested 4 RL algorithms, analyzed hyper-parameter sensitivity.
result Some RL implementations can be applied to physical robots with proper setup, but hyper-parameters need re-tuning.
Prunes neural networks while preserving accuracy, using sensitivity sampling.
problem Sparsifying neural networks while maintaining predictive accuracy.
method Uses sensitivity sampling to construct an importance distribution, then adaptively prunes weights.
result Pruned networks incur minimal loss in performance compared to original networks.
Efficiently computes optimal policies for Entropic Risk Measures.
problem Optimizing risk-sensitive metrics in MDPs is computationally expensive.
method Uses Entropic Risk Measures and novel structural analysis for efficient computation.
result Achieves strong performance in various decision-making scenarios.
Optimal AFs minimize RFR test error and sensitivity.
problem Finding optimal AFs for RFR to minimize test error and sensitivity.
method Closed-form solution for AFs minimizing test error and sensitivity under different functional parsimony.
result Optimal AFs can be linear, saturated linear, or Hermite polynomial expressions.
Generatability in metric spaces studied with novel novelty parameters.
problem Understanding generatability in metric spaces with asymmetric novelty parameters.
method Introducing (ε,ε′)-closure dimension to characterize uniform and non-uniform generatability. result Generatability is stable across novelty scales in doubling spaces but can be highly scale-sensitive in general metric spaces.
New method explains sensitivity of test data uncertainty in Bayesian inference.
problem Widespread belief that test data similarity reduces epistemic uncertainty.
method Information-theoretic decomposition of predictive uncertainty.
result Defines sensitivity using information-theoretic quantities.