Improved signal processing for long-distance optical signals.
problem Compensating walk-off effect in long-distance optical signals.
method Sub-banded DSP architecture with deep learning for walk-off compensation.
result 2.8 dB SNR improvement over linear equalization.
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.
Study multi-armed bandits with compensation to maximize total reward and minimize payments.
problem Optimize reward collection from short-term players with compensation.
method Propose KCMAB problem, provide lower bound, analyze three algorithms, and demonstrate performance.
result Algorithms achieve O(log T) regret and O(log T) compensation matching theoretical lower bound.
Machine learning improves PMD compensation in multiplexed systems.
problem Improving performance in multiplexed systems with PMD.
method Model-based machine learning parameterizing the Manakov-PMD equation.
result Performance close to PMD-free case achieved with hardware-friendly DBP and PMD compensation.
New multi-step approach improves fiber nonlinearity compensation efficiency.
problem Fewer steps are traditionally considered better for fiber nonlinearity compensation.
method Carefully designed multi-step machine learning approaches.
result Multi-step approaches lead to better performance-complexity trade-offs.
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.
Proposes a new algorithm to reduce communication costs in decentralized training.
problem How to apply error-compensated compression to decentralized training.
method Error-compensated stochastic gradient descent for decentralized training.
result Proposed algorithm outperforms existing methods in communication cost reduction.
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.
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.
A new IC-Connection improves disentanglement in conditional GANs.
problem Poor disentanglement of latent variables in conditional GANs.
method Information Compensation Connection (IC-Connection) for disentanglement.
result Our method achieves better disentanglement than state-of-the-art GANs.
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…
This paper optimizes autonomous vehicle controllers using data-driven methods.
problem Designing robust controllers for autonomous vehicles that handle external and internal disturbances.
method Data-driven approach using principal component analysis and time delay neural networks.
result Improved controller performance through a feed-forward compensator.
Proposes DC-S3GD for efficient large-scale decentralized neural network training.
problem Training large-scale decentralized neural networks efficiently.
method Decentralized stale-synchronous version of DC-ASGD with gradient correction.
result Achieves state-of-the-art results in training Convolutional Neural Networks.
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…
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. A new method reduces communication in Federated Learning by pulling less often.
problem Reducing communication overhead in Federated Learning.
method Pulling Reduction with Local Compensation (PRLC) for SGD.
result PRLC achieves lower pulling frequency and maintains the same convergence rate as synchronous SGD.
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…
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.
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.
A CNN-based method improves DTI of the human heart, compensating for motion.
problem Signal loss due to heart motion in DTI.
method Invertible Wavelet Scattering using CNN.
result Effective motion compensation and improved fiber structures.
SCN learns and compensates for data bias in citizen science projects.
problem Data bias in citizen science datasets.
method End-to-end learning scheme that learns and compensates for data shift.
result SCN outperforms models that ignore data bias and handles massive high-dimensional data.
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.
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…
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.
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.
The paper proves weak continuity of Cartan structural system on semi-Riemannian manifolds with lower regularity.
problem Weak continuity of the Cartan structural system on semi-Riemannian manifolds with lower regularity.
method Formulated and proved a geometric compensated compactness theorem, deduced Lp weak continuity of the Cartan structural system. result Weak continuity of the Cartan structural system and Gauss-Codazzi-Ricci system on semi-Riemannian manifolds with lower regularity.
Study proposes framework for cyber bonds to compensate cyber attack losses.
problem Cyber risk treatment in finance industry.
method Developed a framework, used publicly available data to determine loss distribution parameters, numerically simulated bond price and characteristics, considered two coupon calculation approaches.
result Numerical simulations of cyber bond price, yield, and characteristics.
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.
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.
A fundamental problem in differential geometry is to characterize intrinsic metrics on a two-dimensional Riemannian manifold M2 which can be realized as isometric immersions into R3. This problem can be formulated as initial and/or boundary value problems for a system of nonlinear partial differential…
Study on optimal fees in hedge funds with first-loss compensation.
problem Determining the best fee structure for hedge funds with first-loss compensation.
method Solved the manager's non-concave utility maximization problem, calculated Pareto optimal first-loss schemes, and maximized a decision criterion on this set.
result Traditional fees are not Pareto optimal, and the preferred first-loss coverage guarantee varies with investor and market factors.
We analyze a new type of debt that rewards investors based on company performance.
problem Challenges in accounting and pricing equity-based debt obligations.
method Formulated and solved the associated mathematical problem in discrete and continuous time settings using FBSDE and decoupling fields.
result Solved the continuous time problem using FBSDE and decoupling fields.
Incentivized exploration improves MAB performance under reward drift.
problem Improving exploration in multi-armed bandits with biased feedback.
method Analysis of three MAB algorithms (UCB, ε-Greedy, Thompson Sampling) under drifted reward feedback.
result All algorithms achieve O(logT) regret and compensation under drifted reward. The paper models market dynamics using a limit order book system to explain slippage and inefficiency.
problem Inefficiency in matching markets due to structural liquidity constraints and slippage.
method Introduces a market microstructure framework with a latent preference state matrix and a dynamic discrete choice execution model.
result Persistent slippage and regional invariance of preference orderings are explained by liquidity thresholds.
Successful implementation of California's Renewable Portfolio Standard (RPS) mandating 33 percent renewable energy generation by 2020 requires inclusion of a robust strategy to mitigate increased risk of energy deficits (blackouts) due to short time-scale (sub 1 hour) intermittencies in renewable energy sources. Of the…
Forward hedging reshapes incentive provision in firms.
problem How does forward hedging affect incentive provision in firms?
method We consider a CARA framework to jointly characterize optimal production, compensation, and static hedging in equilibrium.
result Delegation and external hedging are partial substitutes, and delegation can increase firm value even when the agent is more risk averse.
Cubic spline smoothing improves interpolation between irregularly sampled data.
problem Interpolation discontinuity in recurrent neural networks for irregularly sampled sequences.
method Cubic spline smoothing compensation module trained end-to-end with ODE-RNN.
result Improves interpolation between irregularly sampled data points.
The intensity of a default time is obtained by assuming that the default indicator process has an absolutely continuous compensator. Here we drop the assumption of absolute continuity with respect to the Lebesgue measure and only assume that the compensator is absolutely continuous with respect to a general σ-finite …
The Shapley value method calculates data contributions efficiently.
problem Valuing data contributions fairly among multiple contributors.
method Utilizing the Shapley value, a game-theoretic approach, with efficient algorithms.
result Efficient algorithms approximate the Shapley value for data valuation.
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.