Fetching the paper…
Reading the bibliography…
In the problem of domain generalization (DG), there are labeled training data sets from several related prediction problems, and the goal is to make accurate predictions on future unlabeled data sets that are not known to the learner.
Probability Measures on Metric Spaces
Kalyanapuram Rangachari Parthasarathy · 1967
Earlier work this paper cites.
On the non-parametric estimation of mixture proportions
Peter Hall · 1981
Earlier work this paper cites.
Minimum distance non-parametric estimation of mixture proportions
D. Michael Titterington · 1983
Earlier work this paper cites.
Remarks on inequalities for probabilities of large deviations
Iosif F. Pinelis and Aleksandr Ivanovich Sakhanenko · 1985
Earlier work this paper cites.
A study of cross-validation and bootstrap for accuracy estimation and model selection
Ron Kohavi · 1995
Earlier work this paper cites.
Is learning the n-th thing any easier than learning the first?
Sebastian Thrun · 1996
Earlier work this paper cites.
Multitask learning
Rich Caruana · 1997
Earlier work this paper cites.
Making large-scale SVM learning practical
Thorsten Joachims · 1999
Earlier work this paper cites.
A model of inductive bias learning
Jonathan Baxter · 2000
Earlier work this paper cites.
Rademacher penalties and structural risk minimization
Vladimir Koltchinskii · 2001
Earlier work this paper cites.
Adjusting the outputs of a classifier to new a priori probabilities may significantly improve classification accuracy: Evidence from a multi-class problem in remote sensing
Patrice Latinne, Marco Saerens, and Christine Decaestecker · 2001
Earlier work this paper cites.
Using the Nyström method to speed up kernel machines
Christopher Williams and Matthias Seeger · 2001
Earlier work this paper cites.
Rademacher and Gaussian complexities: Risk bounds and structural results
Peter Bartlett and Shahar Mendelson · 2002
Earlier work this paper cites.
Foundations of Modern Probability
Olav Kallenberg · 2002
Earlier work this paper cites.
An Introduction to the Theory of Point Processes, volume I: Elementary Theory and Methods
Daryl J. Daley and David Vere-Jones · 2003
Earlier work this paper cites.
Learning and evaluating classifiers under sample selection bias
Bianca Zadrozny · 2004
Earlier work this paper cites.
On the Nyström method for approximating a gram matrix for improved kernel-based learning
Petros Drineas and Michael W. Mahoney · 2005
Earlier work this paper cites.
Learning multiple tasks with kernel methods
Theodoros Evgeniou, Charles A. Michelli, and Massimiliano Pontil · 2005
Earlier work this paper cites.
Large margin methods for structured and interdependent output variables
Ioannis Tsochantaridis, Thorsten Joachims, Thomas Hofmann, and Yasemin Altun · 2005
Earlier work this paper cites.
Convexity, classification, and risk bounds
Peter Bartlett, Michael Jordan, and Jon McAuliffe · 2006
Earlier work this paper cites.
Automated in-silico detection of cell populations in flow cytometry readouts and its application to leukemia disease monitoring
Joern Toedling, Peter Rhein, Richard Ratei, Leonid Karawajew, and Rainer Spang · 2006
Earlier work this paper cites.
Predicting Structured Data
Gökhan Bakır, Thomas Hofmann, Bernhard Schölkopf, Alexander J Smola, and Ben Taskar · 2007
Earlier work this paper cites.
Analysis of representations for domain adaptation
Shai Ben-David, John Blitzer, Koby Crammer, and Fernando Pereira · 2007
Earlier work this paper cites.
Correcting sample selection bias by unlabeled data
Jiayuan Huang, Alexander J. Smola, Arthur Gretton, Karsten M. Borgwardt, and Bernhard Scholkopf · 2007
Earlier work this paper cites.
Random features for large-scale kernel machines
Ali Rahimi and Ben Recht · 2007
Earlier work this paper cites.
Learning bounds for domain adaptation
John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman · 2008
Earlier work this paper cites.
Sample selection bias correction theory
Corinna Cortes, Mehryar Mohri, Michael Riley, and Afshin Rostamizadeh · 2008
Earlier work this paper cites.
An Introduction to the Theory of Point Processes, volume II: General Theory and Structure
Daryl J. Daley and David Vere-Jones · 2008
Earlier work this paper cites.
LIBLINEAR: A library for large linear classification
Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin · 2008
Earlier work this paper cites.
A dual coordinate descent method for large-scale linear SVM
Cho-Jui Hsieh, Kai-Wei Chang, Chih-Jen Lin, S. Sathiya Keerthi, and S. Sundararajan · 2008
Earlier work this paper cites.
Support Vector Machines
Ingo Steinwart and Andreas Christmann · 2008
Earlier work this paper cites.
Direct importance estimation for covariate shift adaptation
Masashi Sugiyama, Taiji Suzuki, Shinichi Nakajima, Hisashi Kashima, Paul von Bünau, and Motoaki Kawanabe · 2008
Cited alongside, same era.
Discriminative learning under covariate shift
Steffen Bickel, Michael Brückner, and Tobias Scheffer · 2009
Cited alongside, same era.
A least-squares approach to direct importance estimation
Takafumi Kanamori, Shohei Hido, and Masashi Sugiyama · 2009
Cited alongside, same era.
Transfer bounds for linear feature learning
Andreas Maurer · 2009
Cited alongside, same era.
Dataset Shift in Machine Learning
Joaquin Quionero-Candela, Masashi Sugiyama, Anton Schwaighofer, and Neil Lawrence · 2009
Cited alongside, same era.
When training and test sets are different: characterising learning transfer
Amos J Storkey · 2009
Cited alongside, same era.
Robust orbit determination and classification: A learning theoretic approach
Srinagesh Sharma and James W. Cutler · 2015
Later among the works it cites.
Optimal rates for random Fourier features
Bharath Sriperumbudur and Zoltán Szabó · 2015
Later among the works it cites.
On the error of random Fourier features
Danica J. Sutherland and Jeff Schneider · 2015
Later among the works it cites.
Multi-source domain adaptation: A causal view
Kun Zhang, Mingming Gong, and Bernhard Scholkopf · 2015
Later among the works it cites.
Classification with asymmetric label noise: Consistency and maximal denoising
Gilles Blanchard, Marek Flaska, Gregory Handy, Sara Pozzi, and Clayton Scott · 2016
Later among the works it cites.
Learning attributes equals multi-source domain generalization
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Heterogeneous multitask learning with joint sparsity constraints
Xiaolin Yang, Seyoung Kim, and Eric P. Xing · 2009
Cited alongside, same era.
A theory of learning from different domains
Shai Ben-David, John Blitzer, Koby Crammer, Alex Kulesza, Fernando Pereira, and Jennifer Wortman Vaughan · 2010
Cited alongside, same era.
Universal kernels on non-standard input spaces
Andreas Christmann and Ingo Steinwart · 2010
Cited alongside, same era.
Hilbert space embeddings and metrics on probability measures
Bharath Sriperumbudur, Arthur Gretton, Kenji Fukumizu, Bernhard Schölkopf, and Gert Lanckriet · 2010
Cited alongside, same era.
Accurate telemonitoring of Parkinson’s disease progression by noninvasive speech tests
Athanasios Tsanas, Max A. Little, Patrick E. McSharry, and Lorraine O. Ramig · 2010
Cited alongside, same era.
Machine Learning for Patient-Adaptive Ectopic Beat Classication
Jenna Wiens · 2010
Cited alongside, same era.
Chuang Gan, Tianbao Yang, and Boqing Gong · 2016
Later among the works it cites.
A new pac-bayesian perspective on domain adaptation
Pascal Germain, Amaury Habrard, François Laviolette, and Emilie Morvant · 2016
Later among the works it cites.
Domain adaptation with conditional transferable components
Mingming Gong, Kun Zhang, Tongliang Liu, Dacheng Tao, Clark Glymour, and Bernhard Schölkopf · 2016
Later among the works it cites.
The benefit of multitask representation learning
Andreas Maurer, Massimiliano Pontil, and Bernardino Romera-Paredes · 2016
Later among the works it cites.
Learning theory for distribution regression
Zoltán Szabó, Bharath K Sriperumbudur, Barnabás Póczos, and Arthur Gretton · 2016
Later among the works it cites.
Model-agnostic meta-learning for fast adaptation of deep networks
Chelsea Finn, Pieter Abbeel, and Sergey Levine · 2017
Closest in time.
Scatter component analysis: A unified framework for domain adaptation and domain generalization
Muhammad Ghifary, David Balduzzi, W. Bastiaan Kleijn, and Mengjie Zhang · 2017
Closest in time.
Deeper, broader and artier domain generalization
Da Li, Yongxin Yang, Yi-Zhe Song, and Timothy M Hospedales · 2017
Closest in time.
Unified deep supervised domain adaptation and generalization
Saeid Motiian, Marco Piccirilli, Donald A. Adjeroh, and Gianfranco Doretto · 2017
Closest in time.
Generalization properties of learning with random features
Alessandro Rudi and Lorenzo Rosasco · 2017
Closest in time.
Fisher consistency for prior probability shift
Dirk Tasche · 2017
Closest in time.
MetaReg: Towards domain generalization using meta-regularization
Yogesh Balaji, Swami Sankaranarayanan, and Rama Chellappa · 2018
Closest in time.
Classification with imperfect training labels
Timothy I. Cannings, Yingying Fan, and Richard J. Samworth · 2018
Closest in time.
Deep domain generalization with structured low-rank constraint
Zhengming Ding and Yun Fu · 2018
Closest in time.
Learning from binary labels with instance-dependent noise
Aditya Krishna Menon, Brendan van Rooyen, and Nagarajan Natarajan · 2018
Closest in time.
Cost-sensitive learning with noisy labels
Nagarajan Natarajan, Inderjit S. Dhillon, Pradeep Ravikumar, and Ambuj Tewari · 2018
Closest in time.
Generalizing across domains via cross-gradient training
Shiv Shankar, Vihari Piratla, Soumen Chakrabarti, Siddhartha Chaudhuri, Preethi Jyothi, and Sunita Sarawagi · 2018
Closest in time.
A theory of learning with corrupted labels
Brendan van Rooyen and Robert C. Williamson · 2018
Closest in time.
Adversarial invariant feature learning with accuracy constraint for domain generalization
Kei Akuzawa, Yusuke Iwasawa, and Yutaka Matsuo · 2019
Closest in time.
Regularized learning for domain adaptation under label shifts
Kamyar Azizzadenesheli, Anqi Liu, Fanny Yang, and Animashree Anandkumar · 2019
Closest in time.
Domain generalization by solving jigsaw puzzles
Fabio Maria Carlucci, Antonio D’Innocente, Silvia Bucci, Barbara Caputo, and Tatiana Tommasi · 2019
Closest in time.
Domain generalization via model-agnostic learning of semantic features
Qi Dou, Daniel Coelho de Castro, Konstantinos Kamnitsas, and Ben Glocker · 2019
Closest in time.
Domain generalization via multidomain discriminant analysis
Shoubo Hu, Kun Zhang, Zhitang Chen, and Laiwan Chan · 2019
Closest in time.
A generalized Neyman-Pearson criterion for optimal domain adaptation
Clayton Scott · 2019
Closest in time.
Learning robust representations by projecting superficial statistics out
Haohan Wang, Zexue He, Zachary C. Lipton, and Eric P. Xing · 2019
Closest in time.