Study optimal control strategy for hedge funds managers with PSAHARA utility family.
problem Optimizing risk and reward in incomplete markets with non-monotone risk aversion and convex compensation.
method Introduced PSAHARA utility family to model non-monotone risk aversion and convex compensation. Proved concavification techniques for non-concave utility functions. Derived explicit optimal control strategy.
result PSAHARA utility induces risk-taking behavior even with convex compensation, leading to high returns and volatility.
Federated Learning is a powerful machine learning paradigm to cooperatively train a global model with highly distributed data. A major bottleneck on the performance of distributed Stochastic Gradient Descent (SGD) algorithm for large-scale Federated Learning is the communication overhead on pushing local gradients and …
The Canonical Regression Quantile method predicts CEO compensation and future performance.
problem Determining fair CEO compensation and its impact on company performance.
method Canonical Regression Quantile method to assess CEO pay and performance.
result The method can predict future CEO performance and distinguish over/underpaid CEOs.
The paper simplifies calculus for semimartingales using multiplicative compensation.
problem Developing a formula for complex-valued semimartingales to simplify stochastic calculus.
method Multiplicative compensation for complex-valued semimartingales.
result The stochastic exponential of complex-valued semimartingales becomes a true martingale after compensation.
We propose and study the known-compensation multi-arm bandit (KCMAB) problem, where a system controller offers a set of arms to many short-term players for T steps. In each step, one short-term player arrives to the system. Upon arrival, the player aims to select an arm with the current best average reward and receiv…
The paper extends Strassen's theorem to include biased martingales for American options.
problem Existence of martingales for arbitrage-free prices of American options.
method Derives an extension of Strassen's theorem linking biased martingales to strengthened convex order.
result Characterizes the strengthened convex order through integrals with respect to compensated Poisson processes.
EControl improves fast distributed optimization with compression and error control.
problem Stable convergence issues in distributed training with compression.
method Proposes EControl to regulate error compensation and prove fast convergence.
result Proves fast convergence for EControl in various convex settings without additional assumptions.
Study incentivizes exploration in non-stationary MAB with compensation.
problem Incentivized exploration for non-stationary stochastic bandits with biased feedback.
method Proposed algorithms for abruptly-changing and continuously-changing non-stationary environments.
result Achieves sublinear regret and compensation over time.
New neural network improves MRI reconstruction for non-Cartesian data.
problem Improving MRI reconstruction for non-Cartesian data acquisitions.
method Density-compensated unrolled neural networks.
result Density-compensated unrolled neural networks outperform baselines.
Improves privacy guarantees by analyzing randomness in privacy-preserving mechanisms.
problem Balancing user privacy and business constraints in privacy-preserving mechanisms.
method Analyzes explicit and implicit randomness in privacy mechanisms and proposes a probabilistic calibration method.
result Proposes privacy at risk, providing stronger privacy guarantees with quantifiable risks.
The paper analyzes fairness of compensation-based risk-sharing schemes for fund payouts.
problem Fair allocation of payouts in an endowment contingency fund.
method Analyzes two types of administrators and general non-negative loss distributions.
result General conditions for actuarial fairness are provided.
When the planning horizon is long, and the safe asset grows indefinitely, isoelastic portfolios are nearly optimal for investors who are close to isoelastic for high wealth, and not too risk averse for low wealth. We prove this result in a general arbitrage-free, frictionless, semimartingale model. As a consequence, op…
A machine learning model for PMD compensation in dual-polarization systems.
problem Compensating for polarization-mode dispersion (PMD) in dual-polarization systems.
method Model-based machine learning approach using the split-step Fourier method for the Manakov-PMD equation.
result The model converges to within 1% of peak dB performance after 428 iterations, achieving a 0.30 dB reduction in effective signal-to-noise ratio compared to PMD-free case.
We present a method to compensate statistical errors in the calculation of correlations on asynchronous time series. The method is based on the assumption of an underlying time series. We set up a model and apply it to financial data to examine the decrease of calculated correlations towards smaller return intervals (E…
Extends compactness theory to variable-coefficient pseudo-differential operators on manifolds.
problem Compensated compactness for pseudodifferential operators on vector bundles.
method Establishes a theorem for weakly convergent sequences of sections under a pseudo-differential operator.
result Quadratic form converges in distributional sense under certain conditions.
Communication is a key bottleneck in distributed training. Recently, an \emph{error-compensated} compression technology was particularly designed for the \emph{centralized} learning and receives huge successes, by showing significant advantages over state-of-the-art compression based methods in saving the communication…
Commonly used in computer vision and other applications, robust PCA represents an algorithmic attempt to reduce the sensitivity of classical PCA to outliers. The basic idea is to learn a decomposition of some data matrix of interest into low rank and sparse components, the latter representing unwanted outliers. Althoug…
Data parallelism has become the de facto standard for training Deep Neural Network on multiple processing units. In this work we propose DC-S3GD, a decentralized (without Parameter Server) stale-synchronous version of the Delay-Compensated Asynchronous Stochastic Gradient Descent (DC-ASGD) algorithm. In our approach, w…
We propose a model-based machine-learning approach for polarization-multiplexed systems by parameterizing the split-step method for the Manakov-PMD equation. This approach performs hardware-friendly DBP and distributed PMD compensation with performance close to the PMD-free case.
We discuss the pricing of defaultable assets in an incomplete information model where the default time is given by a first hitting time of an unobservable process. We show that in a fairly general Markov setting, the indicator function of the default has an absolutely continuous compensator. Given this compensator we t…
For the efficient compensation of fiber nonlinearity, one of the guiding principles appears to be: fewer steps are better and more efficient. We challenge this assumption and show that carefully designed multi-step approaches can lead to better performance-complexity trade-offs than their few-step counterparts.
UDVD uses deep learning to denoise videos without supervision.
problem Lack of clean video data for training deep learning models.
method UDVD is a CNN trained solely on noisy video data, adapting to local motion.
result UDVD performs as well as supervised methods, even with limited training data.
We present two statistical causes for the distortion of correlations on high-frequency financial data. We demonstrate that the asynchrony of trades as well as the decimalization of stock prices has a large impact on the decline of the correlation coefficients towards smaller return intervals (Epps effect). These distor…
Study compactness and continuity in Sobolev wave front set spaces for smooth vector bundles.
problem Compactness and continuity in Sobolev wave front set spaces for smooth vector bundles.
method Introduced a locally convex topology, extended compactness theorem, studied pseudo-differential operators, and applied to microlocal defect measures.
result Extended microlocal defect measures and compensated compactness theorem to Sobolev wave front set spaces.
A reliable controller is critical and essential for the execution of safe and smooth maneuvers of an autonomous vehicle.The controller must be robust to external disturbances, such as road surface, weather, and wind conditions, and so on.It also needs to deal with the internal parametric variations of vehicle sub-syste…
Extends weak continuity of Yang-Mills connections to a broader class.
problem Weak compactness of Ω-Yang-Mills connections. method Compensation compactness argument applied to Yang-Mills fields.
result Weak continuity result extended to Ω-Yang-Mills connections. In recent years, unsupervised/weakly-supervised conditional generative adversarial networks (GANs) have achieved many successes on the task of modeling and generating data. However, one of their weaknesses lies in their poor ability to separate, or disentangle, the different factors that characterize the representation…
A second order self-adjoint operator Δ=S∂2+U is uniquely defined by its principal symbol S and potential U if it acts on half-densities. We analyse the potential U as a compensating field (gauge field) in the sense that it compensates the action of coordinate transformations on the second derivatives in…
Paper proposes ABDR for convex subspace clustering with adaptive block diagonal representation.
problem Subspace clustering with block diagonal structure for noisy data.
method ABDR explicitly pursues block diagonality without sacrificing convexity, using a specially designed convex regularizer.
result Experimental results show ABDR outperforms state-of-the-arts.
This paper proposed a bias-compensated normalized maximum correntropy criterion (BCNMCC) algorithm charactered by its low steady-state misalignment for system identification with noisy input in an impulsive output noise environment. The normalized maximum correntropy criterion (NMCC) is derived from a correntropy based…
The study proves a theorem on Riemannian manifolds for wedge products of weakly convergent differential forms.
problem Analyzing the limiting behavior of wedge products of weakly convergent differential forms on Riemannian manifolds.
method Formulating and proving compensated compactness theorems for wedge products of differential forms on closed Riemannian manifolds.
result The theorem generalizes the div-curl lemma for vectorfields and applies to critical regularity exponents.
Integrated gradients are widely employed to evaluate the contribution of input features in classification models because it satisfies the axioms for attribution of prediction. This method, however, requires an appropriate baseline for reliable determination of the contributions. We propose a compensated integrated grad…
Proposes a compensation mechanism for improving individual forecast confidence.
problem Difficult to assess the quality of individual probabilistic forecasts and their utilities.
method Compensation mechanism based on fair bets and online learning.
result The proposed mechanism cannot be exploited and ensures forecasted utility matches actual utility.
In this paper the method of compensated compactness is applied to the problem of isometric immersion of a two dimensional Riemannian manifold with negative Gauss curvature into three dimensional Euclidean space. Previous applications of the method to this problem have required decay of order t−4 in the Gauss curva…
This paper explores how enforcing equivariance constraints limits neural network expressivity and proposes compensatory model size increases.
problem The impact of enforcing equivariance constraints on the expressive power of neural networks.
method Examined 2-layer ReLU networks, analyzed boundary hyperplanes and channel vectors, and constructed upper bounds on model size required for compensation.
result Enforcing equivariance constraints reduces the expressive power of neural networks, but this can be compensated by increasing model size.
Communication bottleneck has been identified as a significant issue in distributed optimization of large-scale learning models. Recently, several approaches to mitigate this problem have been proposed, including different forms of gradient compression or computing local models and mixing them iteratively. In this paper…
Voltage control plays an important role in the operation of electricity distribution networks, especially with high penetration of distributed energy resources. These resources introduce significant and fast varying uncertainties. In this paper, we focus on reactive power compensation to control voltage in the presence…
We analyze (stochastic) gradient descent (SGD) with delayed updates on smooth quasi-convex and non-convex functions and derive concise, non-asymptotic, convergence rates. We show that the rate of convergence in all cases consists of two terms: (i) a stochastic term which is not affected by the delay, and (ii) a higher …
We present a compensated compactness theorem in Banach spaces established recently, whose formulation is originally motivated by the weak rigidity problem for isometric immersions of manifolds with lower regularity. As a corollary, a geometrically intrinsic div-curl lemma for tensor fields on Riemannian manifolds is ob…
Paper introduces non-linear discounting models for default compensation and climate valuation.
problem Valuation of non-replicable value and damage under default risk.
method Develops two models: one for risk-neutralising discounting and another for survival probability dependent discounting.
result Non-decaying discount factors (negative discount rates) are possible under certain scenarios.
Survey on recent developments in isometric immersions using PDE techniques.
problem Analyzing isometric immersions with low Sobolev regularity.
method Compensated compactness and Coulomb-Uhlenbeck gauges.
result Weak continuity and stability of Gauss-Codazzi-Ricci equations.
We show a concise extension of the monotone stability approach to backward stochastic differential equations (BSDEs) that are jointly driven by a Brownian motion and a random measure for jumps, which could be of infinite activity with a non-deterministic and time inhomogeneous compensator. The BSDE generator function c…
New algorithm reduces communication in federated learning.
problem Communication inefficiency in distributed federated learning.
method Distributionally Robust Federated Averaging (DRFA) with snapshotting scheme.
result DRFA achieves efficient convergence in various settings.
Compensation methods correct overestimation of adversarial robustness in neural networks.
problem Overestimation of adversarial robustness using first-order attack methods.
method Proposed compensation methods address inaccurate gradient computation and reduce backpropagations.
result Empirical evaluation of adversarial robustness is improved with these methods.
We study incentivized exploration for the multi-armed bandit (MAB) problem where the players receive compensation for exploring arms other than the greedy choice and may provide biased feedback on reward. We seek to understand the impact of this drifted reward feedback by analyzing the performance of three instantiatio…
The paper optimizes investment strategies with constraints for life-cycle models.
problem Maximizing consumption, death benefit, and wealth under trading constraints.
method Deep pricing kernel approach to solve constrained portfolio optimization.
result Individuals reduce consumption, insurance demand, and wealth due to constraints.
The top-k error is often employed to evaluate performance for challenging classification tasks in computer vision as it is designed to compensate for ambiguity in ground truth labels. This practical success motivates our theoretical analysis of consistent top-k classification. Surprisingly, it is not rigorously und…
Study optimal investment-reinsurance strategy for insurers under random coefficients and jumps.
problem Optimal investment-reinsurance strategy for insurers with random coefficients and jumps.
method Solves backward stochastic differential equations with jumps under a convex cone constraint.
result Optimal strategy and value remain the same even with random coefficients and jumps.