Goto

Collaborating Authors

 Country


SupplementaryMaterial: " OptimalOrderSimple RegretforGaussianProcessBandits "

Neural Information Processing Systems

InthecaseofSEkernel, the regularity assumption implies the existence ofall weak derivativesoff. The third equation follows from the definition of Zn(x). The first inequality holds by Assumption 2. We utilize Proposition 1 to conclude thatkZn(x)k2 ฯƒ Thesecond inequality holds bydefinition oflight-tailed distributions. Notice thatthecareful choice ofฯ„ andฮธ ensures ฮธฮถi(x) h0, which will be validated next. The seventh line is obtained by replacing the valueof ฮธ.






ExploitingDomain-SpecificFeaturestoEnhance DomainGeneralization

Neural Information Processing Systems

The domain-specific representation is optimized through the meta-learning framework to adapt from source domains, targeting a robust generalization on unseen domains. We empirically show that mDSDI provides competitive results with state-of-the-art techniques in DG.




8f0942c43fcfba4cc66a859b9fcb1bba-Supplemental-Conference.pdf

Neural Information Processing Systems

The expected improvement (EI) is a popular technique to handle the tradeoff between exploration andexploitation underuncertainty. Thistechnique hasbeen widely used in Bayesian optimization but it is not applicable for the contextual bandit problem which is a generalization of the standard bandit and Bayesian optimization.