Goto

Collaborating Authors

 Oceania


ImprovingTransferabilityofRepresentations viaAugmentation-AwareSelf-Supervision

Neural Information Processing Systems

Furthermore, AugSelf can easily be incorporated into recent state-of-the-art representation learning methods with a negligible additional training cost.


PracticalAdversarialAttacksonSpatiotemporal TrafficForecastingModels

Neural Information Processing Systems

However, existing methods assume a reliable and unbiased forecasting environment, which isnot always available inthe wild. Inthis work, we investigate the vulnerability ofspatiotemporal trafficforecasting models andpropose apractical adversarial spatiotemporal attack framework.



In this section, we present detailed proofs for the theoretical derivation of Thm. 1, which aims to solvethefollowingoptimizationproblem: min

Neural Information Processing Systems

These assumptions are not strong and can be satisfied in most of environments includes MuJoCo, Atarigamesandsoon. Let f be an Lebesgue integrable function, P and Q are two probability distributions, |f| C,then EP(x)f(x) EQ(x)f(x) CDTV(P,Q) (5) Proof. Suppose there are two actions a1, a2 under state s, and let Q1(s,a1) = u, Q1(s,a2) = v. In this way, we can derive the upper bound of Ea ฯ€2Q1(s,a) Ea ฯ€1Q1(s,a)asabove. Since both sides of the above equation have the same minimum (here the minima are given by Qk = Q), we can replace the objective in Problem 2 with the upper bound in Eq. (10) and solve therelaxedoptimizationproblem.



Towards Efficient Pre-Trained Language Model via Feature Correlation Distillation

Neural Information Processing Systems

Therefore, a series of attempts Chung et al. [2020], Wu et al. [2020], Wang et al. [2020c], Gordon et al. [2020a], Tang et al. [2019], Aguilar et al. [2019] have been made to review the techniques for effective





AdaptiveImportanceSamplingforFinite-Sum OptimizationandSamplingwithDecreasing Step-Sizes

Neural Information Processing Systems

In this work, we build on this framework and proposeAvare, a simple and efficient algorithm for adaptive importance sampling for finite-sum optimization and sampling with decreasing step-sizes.