The paper addresses risk sharing and variability measures among agents with general risk preferences.
problem Risk sharing and variability measures among agents with general risk preferences.
method Characterizes Pareto-optimal allocations using Gini deviation, mean-median deviation, and inter-quantile difference as variability measures.
result Optimal allocations are not comonotonic and feature a mixture of pairwise counter-monotonic structures.
TailCoR measures co-movement of financial crises events.
problem Measuring co-movement of financial crises events.
method Combines linear and non-linear dependencies using tail inter quantile range.
result TailCoR performs well in small samples and no optimisations are needed.
We introduce and compare new variability measures based on risk quantiles.
problem Comparing variability measures in risk management.
method Developed a framework for one-parameter families of inter-Expected Shortfall differences and inter-expectile differences.
result Characterized symmetric and comonotonic variability measures as mixtures of inter-Expected Shortfall differences.
Paper provides new bounds for risk aggregation and sharing.
problem Quantitative risk management and robust risk aggregation with dependence uncertainty.
method Established new inequality for RVaR, derived extended convolution bounds, and analyzed risk sharing for averaged quantiles.
result Extended convolution bounds for robust risk aggregation and risk sharing, providing sharpness conditions and explicit expressions.
Sharp bounds for distortion risk metrics under uncertain distributions.
problem Modeling risk metrics under distributional uncertainty.
method Established bounds for distortion risk metrics using specific features of underlying distributions.
result Identified worst- and best-case values of distortion risk metrics.
New supervised and unsupervised NFLTs for elliptical distributions.
problem Understanding unsupervised No Free Lunch Theorems for elliptical distributions.
method Proved two equally optimal strategies for elliptical distributions, inspired PRIM-based bump-hunting algorithms.
result Optimal strategies for selecting principal components based on variance or volume.
We evaluate the hedging performance of a high-order compact finite difference scheme from [4] for option pricing in Bates model. We compare the scheme's hedging performance to standard finite difference methods in different examples. We observe that the new scheme outperforms a standard, second-order central finite dif…
ADS explains object differences by quantifying and removing underlying properties.
problem Explaining differences between two object images.
method Align-Deform-Subtract (ADS) framework that uses semantic alignments and iterative quantification/removal of differences.
result ADS provides disentangled error measures explaining object differences in terms of underlying properties.
Proposes Population Difference Criterion for visually observed subpopulation differences.
problem Statistical significance of visually observed subpopulation differences in high-dimensional and high-signal contexts.
method Balanced permutation approach and bootstrap confidence interval for quantifying uncertainty.
result Balanced permutation approach is more powerful in high-signal contexts.
Typically options with a path dependent payoff, such as Target Accumulation Redemption Note (TARN), are evaluated by a Monte Carlo method. This paper describes a finite difference scheme for pricing a TARN option. Key steps in the proposed scheme involve tracking of multiple one-dimensional finite difference solutions,…
Proposes a model combining difference-attention and error-correction LSTMs for improved time series prediction.
problem Improving accuracy in time series prediction.
method Combines difference-attention LSTM and error-correction LSTM in a cascade approach.
result Improves prediction accuracy in time series.
The paper analyzes how the one-dimensional Wasserstein distance captures pointwise density differences in finite samples.
problem Uncertainty in identifying density differences when supports overlap and densities have substantial pointwise differences.
method Analysis using the Poisson process and neural spike train decoding.
result The one-dimensional Wasserstein distance highlights meaningful density differences related to both rate and support.
We introduce principal differences analysis (PDA) for analyzing differences between high-dimensional distributions. The method operates by finding the projection that maximizes the Wasserstein divergence between the resulting univariate populations. Relying on the Cramer-Wold device, it requires no assumptions about th…
A new method for feature fusion in U-Net decoders using difference-based gating.
problem Precise fusion of high-level semantics and low-level details in U-Net decoder reconstruction.
method Proposes two difference-based gating approaches: Feature-difference gating (FDG) and Entropy-difference gating (EDG).
result Both FDG and EDG methods outperform existing attention-based fusion methods, with EDG showing superior performance.
Manifolds uniquely identified by boundary distance differences.
problem Identifying Riemannian manifolds by their boundary distances.
method Distance difference representation on non-convex boundaries without restrictions.
result Complete Riemannian manifolds uniquely determined by their boundary distances.
SDD improves DD for estimating treatment effects by adjusting for confounding.
problem Estimating treatment effects in observational studies with confounding.
method Synthesized Difference in Differences (SDD) using RCT data to infer correct slopes.
result SDD achieves state-of-the-art performance across synthetic and real datasets.
Study of 2d gauged linear sigma models to derive difference equations and spectral data.
problem Understanding monopole solutions and their spectral data in 2d gauged models.
method Analyzing ground states and cohomology of supercharges to derive difference modules and equations.
result Derived novel difference equations for brane amplitudes and hemisphere partition functions.
Study on tilings of the plane with two types of tiles of varying areas.
problem Classifying tilings with minimal interface length.
method Analysis of isoperimetric configurations for different lattice types and tile areas.
result Three distinct tilings configurations found based on tile area ratio.
We introduce a framework to study the effective objectives at different time scales of financial market microstructure. The financial market can be regarded as a complex adaptive system, where purposeful agents collectively and simultaneously create and perceive their environment as they interact with it. It has been s…
Study Berry connections for 2d GLSMs, linking to cohomology theories.
problem Quantise ground states of 2d (2,2) GLSMs on a circle. method Relate periodic monopole solutions to difference modules and vector bundles with filtrations.
result Derive novel difference equations for brane amplitudes and vortex partition functions.
Neuroimaging research has predominantly drawn conclusions based on classical statistics, including null-hypothesis testing, t-tests, and ANOVA. Throughout recent years, statistical learning methods enjoy increasing popularity, including cross-validation, pattern classification, and sparsity-inducing regression. These t…
This work examines the sensitivity of energy distance to mean differences compared to covariance differences.
problem The sensitivity of energy distance to mean differences compared to covariance differences when distributions are close.
method Analyzes the energy distance in the case where distributions are close, focusing on sensitivity to mean and covariance differences.
result Energy distance is more sensitive to mean differences than covariance differences when distributions are close.
Multi-task learning is a powerful method for solving multiple correlated tasks simultaneously. However, it is often impossible to find one single solution to optimize all the tasks, since different tasks might conflict with each other. Recently, a novel method is proposed to find one single Pareto optimal solution with…
This study reveals efficient finite-difference computation for gradient regularization in deep learning.
problem Improving generalization performance in deep learning through gradient regularization.
method Analyzes and reveals a specific finite-difference computation that reduces computational cost and improves generalization performance.
result Finite-difference computation strengthens the implicit bias towards rich regimes and enhances generalization performance.
Ghost points affect stability in finite difference schemes for diffusion equations.
problem Impact of ghost points on stability of finite difference schemes.
method Exploration of explicit Euler finite difference scheme with ghost points on diffusion equation.
result Stability of the scheme is affected by ghost points.
MB-DQN uses different backup lengths for improved reinforcement learning.
problem Improving reinforcement learning with multi-step returns.
method Integrates multi-step returns into bootstrapped DQN with different backup lengths.
result MB-DQN maintains advantages of different backup lengths.
Develops a method to estimate network difference in high-dimensional time series data.
problem Estimating network differences in high-dimensional data can be unreliable.
method Uses an L1 penalty on the difference of inverse spectral densities to estimate network differences.
result Establishes consistency of the method for sparse network differences.
We study the space of linear difference equations with periodic coefficients and (anti)periodic solutions. We show that this space is isomorphic to the space of tame frieze patterns and closely related to the moduli space of configurations of points in the projective space. We define the notion of combinatorial Gale tr…
We prove that the N-colored Jones polynomial for the torus knot T_{s,t} satisfies the second order difference equation, which reduces to the first order difference equation for a case of T_{2,2m+1}. We show that the A-polynomial of the torus knot can be derived from this difference equation. Also constructed is a q-hyp…
Different neural networks trained on the same dataset often learn similar input-output mappings with very different weights. Is there some correspondence between these neural network solutions? For linear networks, it has been shown that different instances of the same network architecture encode the same representatio…
We prove that functions defined on a lattice in a finite dimensional torus with bounded finite differences can be smoothly extended to the whole torus, and relate the bounds on the extension's derivatives with bounds on the original function's finite differences.
Temporal difference learning explained through gradient splitting, improving convergence times.
problem Learning value functions in Markov Decision Processes with linear approximations.
method Interpreting TD learning as gradient splitting and applying convergence proofs from gradient descent.
result Improved convergence times for TD learning, especially with a minor variation.
Since the debut of Evolution Strategies (ES) as a tool for Reinforcement Learning by Salimans et al. 2017, there has been interest in determining the exact relationship between the Evolution Strategies gradient and the gradient of a similar class of algorithms, Finite Differences (FD).(Zhang et al. 2017, Lehman et al. …
Recommender systems are personalized: we expect the results given to a particular user to reflect that user's preferences. Some researchers have studied the notion of calibration, how well recommendations match users' stated preferences, and bias disparity the extent to which mis-calibration affects different user grou…
This research explores how different discrete diffusion kernels affect graph generation quality.
problem The impact of different discrete diffusion kernels on graph generation quality.
method Developed a family of discrete diffusion kernels that converge to different Bernoulli priors.
result The quality of generated graphs is sensitive to the prior used, challenging previous intuitions.
Different optimizer choices lead to different financial model predictions.
problem The impact of optimizer choice on neural network models in financial time series.
method Analysis of large-scale volatility forecasting for S&P 500 stocks using various model-training-pipeline pairs.
result Optimizer choice reshapes non-linear response profiles and temporal dependence in financial models, leading to different functional outcomes.
Introduces a new geometry based on difference angles, showing unique properties.
problem Defining angles independently of circles or rotations.
method Axiomatic system for difference angles, defining new geometric constructs.
result Explicit confirmation of the concurrency of the parabolic Miquel configuration.
Researchers develop methods to prevent GANs from generating certain types of images.
problem Pre-trained GANs sometimes produce undesirable samples.
method Post-editing GANs to prevent certain types of outputs, using three algorithms.
result Our algorithms effectively prevent GANs from generating certain types of images while maintaining high quality.
Bayesian methods improve DiD analysis for ATT estimation.
problem Estimating ATT in DiD designs with improved accuracy.
method Semiparametric Bayesian outcome regression and doubly robust adjustment.
result Bayesian methods provide strong finite-sample performance.
The Empirical Mode Decomposition (EMD) provides a tool to characterize time series in terms of its implicit components oscillating at different time-scales. We apply this decomposition to intraday time series of the following three financial indices: the S\&P 500 (USA), the IPC (Mexico) and the VIX (volatility index US…
Comparing business process variants using event logs is a common use case in process mining. Existing techniques for process variant analysis detect statistically-significant differences between variants at the level of individual entities (such as process activities) and their relationships (e.g. directly-follows rela…
New method for pricing options in stochastic volatility models.
problem Pricing options in models with stochastic volatility.
method Time-adaptive, high-order compact finite difference scheme.
result Extends fourth-order multistep methods to stochastic volatility models.
Acute respiratory infections have epidemic and pandemic potential and thus are being studied worldwide, albeit in many different contexts and study formats. Predicting infection from symptom data is critical, though using symptom data from varied studies in aggregate is challenging because the data is collected in diff…
We give infinitely many examples of 2-bridge knots for which the topological and smooth slice genera differ. The smallest of these is the 12-crossing knot 12a255. These also provide the first known examples of alternating knots for which the smooth and topological genera differ.
A new protocol corrects confounding effects to measure alignment-induced activation shifts accurately.
problem Confounding effects in measuring alignment-induced activation shifts using naive methods.
method Introduces a four-variant decomposition to separate alignment shift from template effects.
result Correctly measures alignment-induced activation shifts, recovering behaviorally active subspace.
Examines different approaches to Poisson structures in Banach spaces.
problem Exploring various definitions of Poisson structures in Banach spaces.
method Presenting and comparing different definitions of Poisson structures.
result Illustrates differences between existing definitions with examples.
We address the problem of estimating the difference between two probability densities. A naive approach is a two-step procedure of first estimating two densities separately and then computing their difference. However, such a two-step procedure does not necessarily work well because the first step is performed without …
Enhances multi-fidelity modeling with DGPs for different input domains.
problem Improving prediction accuracy with multi-fidelity models using different input domains.
method Extends Deep Gaussian Processes (DGPs) to handle different input domains for high and low-fidelity models.
result Demonstrates improved performance on real-world physical problems.