Fetching the paper…
Reading the bibliography…
Domain adaptation has become a prominent problem setting in machine learning and related fields.
1901
Earlier work this paper cites.
W. G. Cochran and D. B. Rubin, “Controlling bias in observational studies: a review,” Sankhyā: Indian Journal of Statistics, Series A , pp. 417–446, 1973
1973
Earlier work this paper cites.
R. Gronau, “Wage comparisons–a selectivity bias,” Journal of Political Economy , vol. 82, no. 6, pp. 1119–1143, 1974
1974
Earlier work this paper cites.
G. J. McLachlan, “Iterative reclassification procedure for constructing an asymptotically optimal rule of allocation in discriminant analysis,” Journal of the American Statistical Association , vol. 70, no. 350, pp. 365–369, 1975
1975
Earlier work this paper cites.
J. J. Heckman, “Sample selection bias as a specification error (with an application to the estimation of labor supply functions),” 1977
1977
Earlier work this paper cites.
H. White, “Consequences and detection of misspecified nonlinear regression models,” Journal of the American Statistical Association , vol. 76, no. 374, pp. 419–433, 1981
1981
Earlier work this paper cites.
A. Melino, “Testing for sample selection bias,” The Review of Economic Studies , vol. 49, no. 1, pp. 151–153, 1982
1982
Earlier work this paper cites.
J. Heckman, “Varieties of selection bias,” American Economic Review , vol. 80, no. 2, pp. 313–318, 1990
1990
Earlier work this paper cites.
G. E. Hinton and R. S. Zemel, “Autoencoders, minimum description length and Helmholtz free energy,” in Advances in Neural Information Processing Systems , 1994, pp. 3–10
1994
Earlier work this paper cites.
G. Widmer and M. Kubat, “Learning in the presence of concept drift and hidden contexts,” Machine Learning , vol. 23, no. 1, pp. 69–101, 1996
1996
Earlier work this paper cites.
D. Wolpert, “The lack of a priori distinctions between learning algorithms,” Neural Computation , vol. 8, no. 7, pp. 1341–1390, 1996
1996
Earlier work this paper cites.
B. Schölkopf, A. Smola, and K.-R. Müller, “Kernel principal component analysis,” in International Conference on Artificial Neural Networks . Springer, 1997, pp. 583–588
1997
Earlier work this paper cites.
F. Vella, “Estimating models with sample selection bias: a survey,” Journal of Human Resources , pp. 127–169, 1998
1998
Earlier work this paper cites.
H. Shimodaira, “Improving predictive inference under covariate shift by weighting the log-likelihood function,” Journal of Statistical Planning and Inference , vol. 90, no. 2, pp. 227–244, 2000
2000
Earlier work this paper cites.
C. Elkan, “The foundations of cost-sensitive learning,” in International Joint Conference on Artificial Intelligence , vol. 17, 2001, pp. 973–978
2001
Earlier work this paper cites.
M. Vidyasagar, A theory of learning and generalization . Springer-Verlag New York, Inc., 2002
2002
Earlier work this paper cites.
N. V. Chawla, K. W. Bowyer, L. O. Hall, and W. P. Kegelmeyer, “Smote: synthetic minority over-sampling technique,” Journal of Artificial Intelligence Research , vol. 16, pp. 321–357, 2002
2002
Earlier work this paper cites.
E. G. Miller, “A new class of entropy estimators for multi-dimensional densities,” in International Conference on Acoustics, Speech, and Signal Processing , vol. 3, 2003, pp. III–297
2003
Earlier work this paper cites.
T. L. Fare, E. M. Coffey, H. Dai, Y. D. He, D. A. Kessler, K. A. Kilian, J. E. Koch, E. LeProust, M. J. Marton, M. R. Meyer et al. , “Effects of atmospheric ozone on microarray data quality,” Analytical Chemistry , vol. 75, no. 17, pp. 4672–4675, 2003
2003
Earlier work this paper cites.
B. Zadrozny, “Learning and evaluating classifiers under sample selection bias,” in International Conference on Machine Learning , 2004, p. 114
2004
Earlier work this paper cites.
D. Kifer, S. Ben-David, and J. Gehrke, “Detecting change in data streams,” in International Conference on Very Large Data Bases , 2004, pp. 180–191
2004
Earlier work this paper cites.
S. Kanazawa, “General intelligence as a domain-specific adaptation.” Psychological Review , vol. 111, no. 2, p. 512, 2004
2004
Earlier work this paper cites.
R. K. Ando and T. Zhang, “A framework for learning predictive structures from multiple tasks and unlabeled data,” Journal of Machine Learning Research , vol. 6, no. Nov, pp. 1817–1853, 2005
2005
Earlier work this paper cites.
M. Sugiyama and K.-R. Müller, “Input-dependent estimation of generalization error under covariate shift,” Statistics & Decisions , vol. 23, no. 4/2005, pp. 249–279, 2005
2005
Earlier work this paper cites.
M. Sugiyama and K.-R. Müller, “Model selection under covariate shift,” in International Conference on Artificial Neural Networks , 2005, pp. 235–240
2005
Earlier work this paper cites.
M. T. Rosenstein, Z. Marx, L. P. Kaelbling, and T. G. Dietterich, “To transfer or not to transfer,” in NIPS 2005 Workshop on Transfer Learning , vol. 898, 2005, pp. 1–4
2005
Earlier work this paper cites.
J. Blitzer, R. McDonald, and F. Pereira, “Domain adaptation with structural correspondence learning,” in Empirical Methods in Natural Language Processing , 2006, pp. 120–128
2006
Earlier work this paper cites.
R. Raina, A. Y. Ng, and D. Koller, “Constructing informative priors using transfer learning,” in International Conference on Machine Learning , 2006, pp. 713–720
2006
Earlier work this paper cites.
M. A. Hernán and J. M. Robins, “Estimating causal effects from epidemiological data,” Journal of Epidemiology & Community Health , vol. 60, no. 7, pp. 578–586, 2006
2006
Earlier work this paper cites.
K. M. Borgwardt, A. Gretton, M. J. Rasch, H.-P. Kriegel, B. Schölkopf, and A. J. Smola, “Integrating structured biological data by kernel maximum mean discrepancy,” Bioinformatics , vol. 22, no. 14, pp. e49–e57, 2006
2006
Earlier work this paper cites.
C. M. Bishop, Pattern recognition and machine learning . Springer, 2006
2006
Earlier work this paper cites.
P. Germain, A. Lacasse, F. Laviolette, and M. Marchand, “A PAC-Bayes risk bound for general loss functions,” in Advances in Neural Information Processing Systems , 2007, pp. 449–456
2007
Earlier work this paper cites.
A. Arnold, R. Nallapati, and W. W. Cohen, “A comparative study of methods for transductive transfer learning,” in International Conference on Data Mining Workshops , 2007, pp. 77–82
2007
Earlier work this paper cites.
J. Blitzer, M. Dredze, F. Pereira et al. , “Biographies, bollywood, boom-boxes and blenders: Domain adaptation for sentiment classification,” in Association for Computational Linguistics , vol. 7, 2007, pp. 440–447
2007
Earlier work this paper cites.
S. Ben-David, J. Blitzer, K. Crammer, and F. Pereira, “Analysis of representations for domain adaptation,” in Advances in Neural Information Processing Systems , 2007, pp. 137–144
2007
Earlier work this paper cites.
J. Jiang and C. Zhai, “Instance weighting for domain adaptation in NLP,” in Annual Meeting of the Association of Computational Linguistics , 2007, pp. 264–271
2007
Earlier work this paper cites.
A. Gretton, K. M. Borgwardt, M. Rasch, B. Schölkopf, and A. J. Smola, “A kernel method for the two-sample-problem,” in Advances in Neural Information Processing Systems , 2007, pp. 513–520
2007
Earlier work this paper cites.
J. Huang, A. Gretton, K. M. Borgwardt, B. Schölkopf, and A. J. Smola, “Correcting sample selection bias by unlabeled data,” in Advances in Neural Information Processing Systems , 2007, pp. 601–608
2007
Earlier work this paper cites.
M. Sugiyama, M. Krauledat, and K.-R. Müller, “Covariate shift adaptation by importance weighted cross validation,” Journal of Machine Learning Research , vol. 8, pp. 985–1005, 2007
2007
Earlier work this paper cites.
S. Bickel, M. Brückner, and T. Scheffer, “Discriminative learning for differing training and test distributions,” in International Conference on Machine Learning , 2007, pp. 81–88
2007
Earlier work this paper cites.
Ó. Pérez and M. Sánchez-Montañés, “A new learning strategy for classification problems with different training and test distributions,” in International Conference on Artificial Neural Networks . Springer, 2007, pp. 178–185
2007
Earlier work this paper cites.
X. Li and J. Bilmes, “A Bayesian divergence prior for classifier adaptation,” in Conference on Artificial Intelligence and Statistics , 2007, pp. 275–282
2007
Earlier work this paper cites.
W. E. Johnson, C. Li, and A. Rabinovic, “Adjusting batch effects in microarray expression data using empirical Bayes methods,” Biostatistics , vol. 8, no. 1, pp. 118–127, 2007
2007
Earlier work this paper cites.
C. M. Stonnington, G. Tan, S. Klöppel, C. Chu, B. Draganski, C. R. Jack Jr, K. Chen, J. Ashburner, and R. S. Frackowiak, “Interpreting scan data acquired from multiple scanners: a study with Alzheimer’s disease,” Neuroimage , vol. 39, no. 3, pp. 1180–1185, 2008
2008
Earlier work this paper cites.
A. Farhadi and M. K. Tabrizi, “Learning to recognize activities from the wrong view point,” in European Conference on Computer Vision , 2008, pp. 154–166
2008
Earlier work this paper cites.
J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. Wortman, “Learning bounds for domain adaptation,” in Advances in Neural Information Processing Systems , 2008, pp. 129–136
2008
Earlier work this paper cites.
C. Cortes, M. Mohri, M. Riley, and A. Rostamizadeh, “Sample selection bias correction theory,” in Conference on Algorithmic Learning Theory , 2008, pp. 38–53
2008
Earlier work this paper cites.
M. Sugiyama, S. Nakajima, H. Kashima, P. V. Buenau, and M. Kawanabe, “Direct importance estimation with model selection and its application to covariate shift adaptation,” in Advances in Neural Information Processing Systems , 2008, pp. 1433–1440
2008
Earlier work this paper cites.
S. J. Pan, J. T. Kwok, and Q. Yang, “Transfer learning via dimensionality reduction.” in AAAI Conference on Artificial Intelligence , vol. 8, 2008, pp. 677–682
2008
Earlier work this paper cites.
Y. Mansour, M. Mohri, and A. Rostamizadeh, “Domain adaptation with multiple sources,” in Advances in Neural Information Processing Systems , 2009, pp. 1041–1048
2009
Earlier work this paper cites.
——, “Multiple source adaptation and the Rényi divergence,” in Conference on Uncertainty in Artificial Intelligence , 2009, pp. 367–374
2009
Earlier work this paper cites.
G. Schweikert, G. Rätsch, C. Widmer, and B. Schölkopf, “An empirical analysis of domain adaptation algorithms for genomic sequence analysis,” in Advances in Neural Information Processing Systems , 2009, pp. 1433–1440
2009
Earlier work this paper cites.
J. Quionero-Candela, M. Sugiyama, A. Schwaighofer, and N. D. Lawrence, Dataset shift in machine learning . MIT Press, 2009
2009
Earlier work this paper cites.
M. H. Mahmud, “On universal transfer learning,” Theoretical Computer Science , vol. 410, no. 19, pp. 1826–1846, 2009
2009
Earlier work this paper cites.
Y. Mansour, M. Mohri, and A. Rostamizadeh, “Domain adaptation: Learning bounds and algorithms,” in Conference on Learning Theory , 2009
2009
Earlier work this paper cites.
A. J. Storkey, “When training and test sets are different: characterising learning transfer,” in In Dataset Shift in Machine Learning , 2009, pp. 3–28
2009
Earlier work this paper cites.
Y. Tsuboi, H. Kashima, S. Hido, S. Bickel, and M. Sugiyama, “Direct density ratio estimation for large-scale covariate shift adaptation,” Journal of Information Processing , vol. 17, pp. 138–155, 2009
2009
Earlier work this paper cites.
T. Kanamori, S. Hido, and M. Sugiyama, “A least-squares approach to direct importance estimation,” Journal of Machine Learning Research , vol. 10, pp. 1391–1445, 2009
2009
Earlier work this paper cites.
A. Gretton, A. Smola, J. Huang, M. Schmittfull, K. Borgwardt, and B. Schölkopf, “Covariate shift by kernel mean matching,” in Dataset Shift in Machine Learning , Q. Candela, M. Sugiyama, A. Schwaighofer, and N. Lawrence, Eds. MIT Press, 2009, pp. 131–160
2009
Earlier work this paper cites.
——, “Discriminative learning under covariate shift,” Journal of Machine Learning Research , vol. 10, pp. 2137–2155, 2009
2009
Earlier work this paper cites.
Q. Gu and J. Zhou, “Learning the shared subspace for multi-task clustering and transductive transfer classification,” in International Conference on Data Mining , 2009, pp. 159–168
2009
Earlier work this paper cites.
J. R. Finkel and C. D. Manning, “Hierarchical Bayesian domain adaptation,” in Conference of the North American Chapter of the Association for Computational Linguistics , 2009, pp. 602–610
2009
Earlier work this paper cites.
L. Bruzzone and M. Marconcini, “Domain adaptation problems: A DASVM classification technique and a circular validation strategy,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 32, no. 5, pp. 770–787, 2010
2010
Earlier work this paper cites.
S. J. Pan and Q. Yang, “A survey on transfer learning,” IEEE Transactions on Knowledge and Data Engineering , vol. 22, no. 10, pp. 1345–1359, 2010
2010
Earlier work this paper cites.
J. W. Tucker, “Selection bias and econometric remedies in accounting and finance research,” Journal of Accounting Literature , vol. 29, pp. 31–57, 2010
2010
Earlier work this paper cites.
K. Saenko, B. Kulis, M. Fritz, and T. Darrell, “Adapting visual category models to new domains,” European Conference on Computer Vision , pp. 213–226, 2010
2010
Earlier work this paper cites.
T. Van Kasteren, G. Englebienne, and B. J. Kröse, “Transferring knowledge of activity recognition across sensor networks.” in Pervasive Computing , vol. 10. Springer, 2010, pp. 283–300
2010
Earlier work this paper cites.
C. Widmer, N. C. Toussaint, Y. Altun, O. Kohlbacher, and G. Rätsch, “Novel machine learning methods for MHC Class I binding prediction,” in International Conference on Pattern Recognition in Bioinformatics . Springer, 2010, pp. 98–109
2010
Earlier work this paper cites.
F. Gieseke, K. L. Polsterer, A. Thom, P. Zinn, D. Bomanns, R.-J. Dettmar, O. Kramer, and J. Vahrenhold, “Detecting quasars in large-scale astronomical surveys,” in International Conference on Machine Learning and Applications , 2010, pp. 352–357
2010
Earlier work this paper cites.
S. Ben-David, J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. W. Vaughan, “A theory of learning from different domains,” Machine Learning , vol. 79, no. 1-2, pp. 151–175, 2010
2010
Earlier work this paper cites.
C. Cortes, Y. Mansour, and M. Mohri, “Learning bounds for importance weighting,” in Advances in Neural Information Processing Systems , 2010, pp. 442–450
2010
Earlier work this paper cites.
S. J. Pan, X. Ni, J.-T. Sun, Q. Yang, and Z. Chen, “Cross-domain sentiment classification via spectral feature alignment,” in International Conference on World wide web , 2010, pp. 751–760
2010
Cited alongside, same era.
S. Si, D. Tao, and B. Geng, “Bregman divergence-based regularization for transfer subspace learning,” IEEE Transactions on Knowledge and Data Engineering , vol. 22, no. 7, pp. 929–942, 2010
2010
Cited alongside, same era.
P. Vincent, H. Larochelle, I. Lajoie, Y. Bengio, and P.-A. Manzagol, “Stacked denoising autoencoders: learning useful representations in a deep network with a local denoising criterion,” Journal of Machine Learning Research , vol. 11, no. Dec, pp. 3371–3408, 2010
2010
Cited alongside, same era.
B. P. Carlin and T. A. Louis, Bayes and empirical Bayes methods for data analysis . Chapman and Hall/CRC, 2010
2010
Cited alongside, same era.
B. Sun and K. Saenko, “Subspace distribution alignment for unsupervised domain adaptation,” in British Machine Vision Conference , 2015, pp. 24–1
2015
Later among the works it cites.
B. Fernando, T. Tommasi, and T. Tuytelaars, “Joint cross-domain classification and subspace learning for unsupervised adaptation,” Pattern Recognition Letters , vol. 65, pp. 60–66, 2015
2015
Later among the works it cites.
R. Caseiro, J. F. Henriques, P. Martins, and J. Batista, “Beyond the shortest path: unsupervised domain adaptation by sampling subspaces along the spline flow,” in Conference on Computer Vision and Pattern Recognition , 2015, pp. 3846–3854
2015
Later among the works it cites.
M. Long, Y. Cao, J. Wang, and M. Jordan, “Learning transferable features with deep adaptation networks,” in International Conference on Machine Learning , 2015, pp. 97–105
2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
J. T. Leek, R. B. Scharpf, H. C. Bravo, D. Simcha, B. Langmead, W. E. Johnson, D. Geman, K. Baggerly, and R. A. Irizarry, “Tackling the widespread and critical impact of batch effects in high-throughput data,” Nature Reviews: Genetics , vol. 11, no. 10, 2010
2010
Cited alongside, same era.
S. Pan, I. Tsang, J. Kwok, and Q. Yang, “Domain adaptation via transfer component analysis,” Neural Networks , vol. 22, no. 2, pp. 199–210, 2011
2011
Cited alongside, same era.
A. Margolis, “A literature review of domain adaptation with unlabeled data,” Rapport Technique, University of Washington , p. 35, 2011
2011
Cited alongside, same era.
A. Torralba and A. A. Efros, “Unbiased look at dataset bias,” in Conference on Computer Vision and Pattern Recognition , 2011, pp. 1521–1528
2011
Cited alongside, same era.
L. Duan, D. Xu, I. W.-H. Tsang, and J. Luo, “Visual event recognition in videos by learning from web data,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 34, no. 9, pp. 1667–1680, 2011
2011
Cited alongside, same era.
V. Peddinti and P. Chintalapoodi, “Domain adaptation in sentiment analysis of Twitter,” in AAAI Conference on Artificial Intelligence , 2011
2011
Cited alongside, same era.
S. Mei, W. Fei, and S. Zhou, “Gene ontology based transfer learning for protein subcellular localization,” BMC Bioinformatics , vol. 12, no. 1, p. 1, 2011
2011
Cited alongside, same era.
Q. Xu and Q. Yang, “A survey of transfer and multitask learning in bioinformatics,” Journal of Computing Science and Engineering , vol. 5, no. 3, pp. 257–268, 2011
2011
Cited alongside, same era.
E. Morvant, “Domain adaptation of weighted majority votes via perturbed variation-based self-labeling,” Pattern Recognition Letters , vol. 51, pp. 37–43, 2015
2015
Later among the works it cites.
N. Courty, R. Flamary, D. Tuia, and A. Rakotomamonjy, “Optimal transport for domain adaptation,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 39, no. 9, pp. 1853–1865, 2016
2016
Later among the works it cites.
2016
Later among the works it cites.
M. Hardt, E. Price, N. Srebro et al. , “Equality of opportunity in supervised learning,” in Advances in Neural Information Processing Systems , 2016, pp. 3315–3323
2016
Later among the works it cites.
M. Gong, K. Zhang, T. Liu, D. Tao, C. Glymour, and B. Schölkopf, “Domain adaptation with conditional transferable components,” in International Conference on Machine Learning , 2016, pp. 2839–2848
2016
Later among the works it cites.
P. Germain, A. Habrard, F. Laviolette, and E. Morvant, “A new PAC-Bayesian perspective on domain adaptation,” in International Conference on Machine Learning , 2016, pp. 859–868
2016
Later among the works it cites.
G. Jacobusse and C. Veenman, “On selection bias with imbalanced classes,” in International Conference on Discovery Science . Springer, 2016, pp. 325–340
2016
Later among the works it cites.
Y. Ganin, E. Ustinova, H. Ajakan, P. Germain, H. Larochelle, F. Laviolette, M. Marchand, and V. Lempitsky, “Domain-adversarial training of neural networks,” Journal of Machine Learning Research , vol. 17, no. 59, pp. 1–35, 2016
2016
Later among the works it cites.
M. Baktashmotlagh, M. Harandi, and M. Salzmann, “Distribution-matching embedding for visual domain adaptation,” Journal of Machine Learning Research , vol. 17, no. 1, pp. 3760–3789, 2016
2016
Later among the works it cites.
W. M. Kouw, L. J. Van Der Maaten, J. H. Krijthe, and M. Loog, “Feature-level domain adaptation,” Journal of Machine Learning Research , vol. 17, no. 171, pp. 1–32, 2016
2016
Later among the works it cites.
M. Long, H. Zhu, J. Wang, and M. I. Jordan, “Unsupervised domain adaptation with residual transfer networks,” in Advances in Neural Information Processing Systems , 2016, pp. 136–144
2016
Later among the works it cites.
K. Bousmalis, G. Trigeorgis, N. Silberman, D. Krishnan, and D. Erhan, “Domain separation networks,” in Advances in Neural Information Processing Systems , 2016, pp. 343–351
2016
Later among the works it cites.
A. Habrard, J.-P. Peyrache, and M. Sebban, “A new boosting algorithm for provably accurate unsupervised domain adaptation,” Knowledge and Information Systems , vol. 47, no. 1, pp. 45–73, 2016
2016
Later among the works it cites.
X. Chen, M. Monfort, A. Liu, and B. D. Ziebart, “Robust covariate shift regression,” in Conference on Artificial Intelligence and Statistics , 2016, pp. 1270–1279
2016
Later among the works it cites.
S. E. Shepstone, K.-A. Lee, H. Li, Z.-H. Tan, and S. H. Jensen, “Total variability modeling using source-specific priors,” IEEE Transactions on Audio, Speech, and Language Processing , vol. 24, pp. 504–517, 2016
2016
Later among the works it cites.
G. Csurka, “A comprehensive survey on domain adaptation for visual applications,” in Domain Adaptation in Computer Vision Applications . Springer, 2017, pp. 1–35
2017
Later among the works it cites.
V. Cheplygina, I. P. Pena, J. H. Pedersen, D. A. Lynch, L. Sørensen, and M. de Bruijne, “Transfer learning for multicenter classification of chronic obstructive pulmonary disease,” Journal of Biomedical and Health Informatics , vol. 22, no. 5, pp. 1486–1496, 2017
2017
Later among the works it cites.
K. Kamnitsas, C. Baumgartner, C. Ledig, V. Newcombe, J. Simpson, A. Kane, D. Menon, A. Nori, A. Criminisi, D. Rueckert et al. , “Unsupervised domain adaptation in brain lesion segmentation with adversarial networks,” in International Conference on Information Processing in Medical Imaging . Springer, 2017, pp. 597–609
2017
Later among the works it cites.
E. Gedik and H. Hung, “Personalised models for speech detection from body movements using transductive parameter transfer,” Personal and Ubiquitous Computing , pp. 1–15, 2017
2017
Later among the works it cites.
L. Tai, G. Paolo, and M. Liu, “Virtual-to-real deep reinforcement learning: Continuous control of mobile robots for mapless navigation,” in IEEE International Conference on Intelligent Robots and Systems , 2017, pp. 31–36
2017
Later among the works it cites.
A. Marco, F. Berkenkamp, P. Hennig, A. P. Schoellig, A. Krause, S. Schaal, and S. Trimpe, “Virtual vs. real: Trading off simulations and physical experiments in reinforcement learning with Bayesian optimization,” in International Conference on Robotics and Automation , 2017, pp. 1557–1563
2017
Later among the works it cites.
M. Wulfmeier, A. Bewley, and I. Posner, “Addressing appearance change in outdoor robotics with adversarial domain adaptation,” in International Conference on Intelligent Robots and Systems , 2017, pp. 1551–1558
2017
Later among the works it cites.
R. Izbicki, A. B. Lee, P. E. Freeman et al. , “Photo- z z estimation: An example of nonparametric conditional density estimation under selection bias,” The Annals of Applied Statistics , vol. 11, no. 2, pp. 698–724, 2017
2017
Later among the works it cites.
N. Quadrianto and V. Sharmanska, “Recycling privileged learning and distribution matching for fairness,” in Advances in Neural Information Processing Systems , 2017, pp. 677–688
2017
Later among the works it cites.
D. Dua and C. Graff, “UCI machine learning repository,” 2017. [Online]. Available: http://archive.ics.uci.edu/ml
2017
Later among the works it cites.
N. Courty, R. Flamary, A. Habrard, and A. Rakotomamonjy, “Joint distribution optimal transportation for domain adaptation,” in Advances in Neural Information Processing Systems , 2017, pp. 3730–3739
2017
Later among the works it cites.
I. Redko, A. Habrard, and M. Sebban, “Theoretical analysis of domain adaptation with optimal transport,” in Joint European Conference on Machine Learning and Knowledge Discovery in Databases , 2017, pp. 737–753
2017
Later among the works it cites.
2017
Later among the works it cites.
K. Bousmalis, N. Silberman, D. Dohan, D. Erhan, and D. Krishnan, “Unsupervised pixel-level domain adaptation with generative adversarial networks,” in Conference on Computer Vision and Pattern Recognition , vol. 1, no. 2, 2017, p. 7
2017
Later among the works it cites.
E. Tzeng, J. Hoffman, K. Saenko, and T. Darrell, “Adversarial discriminative domain adaptation,” in Conference on Computer Vision and Pattern Recognition , vol. 1, no. 2, 2017, p. 4
2017
Later among the works it cites.
S. Sun, B. Zhang, L. Xie, and Y. Zhang, “An unsupervised deep domain adaptation approach for robust speech recognition,” Neurocomputing , vol. 257, pp. 79–87, 2017
2017
Later among the works it cites.
G. Louppe, M. Kagan, and K. Cranmer, “Learning to pivot with adversarial networks,” in Advances in Neural Information Processing Systems , 2017, pp. 981–990
2017
Later among the works it cites.
2017
Later among the works it cites.
2017
Later among the works it cites.
J. Wang, Y. Chen, S. Hao, W. Feng, and Z. Shen, “Balanced distribution adaptation for transfer learning,” in International Conference on Data Mining , 2017, pp. 1129–1134
2017
Later among the works it cites.
D. McNamara and M.-F. Balcan, “Risk bounds for transferring representations with and without fine-tuning,” in International Conference on Machine Learning , 2017, pp. 2373–2381
2017
Later among the works it cites.
Z. Lipton, Y.-X. Wang, and A. Smola, “Detecting and correcting for label shift with black box predictors,” in International Conference on Machine Learning , 2018, pp. 3128–3136
2018
Later among the works it cites.
M. Wang and W. Deng, “Deep visual domain adaptation: A survey,” Neurocomputing , vol. 312, pp. 135–153, 2018
2018
Later among the works it cites.
K. Bousmalis, A. Irpan, P. Wohlhart, Y. Bai, M. Kelcey, M. Kalakrishnan, L. Downs, J. Ibarz, P. Pastor, K. Konolige et al. , “Using simulation and domain adaptation to improve efficiency of deep robotic grasping,” in International Conference on Robotics and Automation , 2018, pp. 4243–4250
2018
Later among the works it cites.
Q. Wang, W. Rao, S. Sun, L. Xie, E. S. Chng, and H. Li, “Unsupervised domain adaptation via domain adversarial training for speaker recognition,” in International Conference on Acoustics, Speech and Signal Processing , 2018, pp. 4889–4893
2018
Later among the works it cites.
2018
Later among the works it cites.
M. Loog, “Supervised classification: Quite a brief overview,” in Machine Learning Techniques for Space Weather , 2018, pp. 113–145
2018
Later among the works it cites.
D. Das and C. George Lee, “Unsupervised domain adaptation using regularized hyper-graph matching,” in International Conference on Image Processing , 10 2018, pp. 3758–3762
2018
Later among the works it cites.
D. Das and C. G. Lee, “Graph matching and pseudo-label guided deep unsupervised domain adaptation,” in International Conference on Artificial Neural Networks , 2018, pp. 342–352
2018
Later among the works it cites.
——, “Sample-to-sample correspondence for unsupervised domain adaptation,” Engineering Applications of Artificial Intelligence , vol. 73, pp. 80–91, 2018
2018
Later among the works it cites.
B. Bhushan Damodaran, B. Kellenberger, R. Flamary, D. Tuia, and N. Courty, “DeepJDOT: Deep joint distribution optimal transport for unsupervised domain adaptation,” in European Conference on Computer Vision , 2018, pp. 447–463
2018
Later among the works it cites.
Q. Chen, Y. Liu, Z. Wang, I. Wassell, and K. Chetty, “Re-weighted adversarial adaptation network for unsupervised domain adaptation,” in Conference on Computer Vision and Pattern Recognition , 2018, pp. 7976–7985
2018
Later among the works it cites.
2018
Later among the works it cites.
J. Shen, Y. Qu, W. Zhang, and Y. Yu, “Wasserstein distance guided representation learning for domain adaptation,” in AAAI Conference on Artificial Intelligence , 2018
2018
Later among the works it cites.
R. Shu, H. H. Bui, H. Narui, and S. Ermon, “A DIRT-T approach to unsupervised domain adaptation,” in International Conference on Learning Representations , 2018
2018
Later among the works it cites.
B. Usman, K. Saenko, and B. Kulis, “Stable distribution alignment using the dual of the adversarial distance,” in International Conference on Learning Representations Workshop , 2018
2018
Later among the works it cites.
2018
Later among the works it cites.
K. Saito, K. Watanabe, Y. Ushiku, and T. Harada, “Maximum classifier discrepancy for unsupervised domain adaptation,” in Conference on Computer Vision and Pattern Recognition , 2018, pp. 3723–3732
2018
Later among the works it cites.
2018
Later among the works it cites.
M. Rojas-Carulla, B. Schoelkopf, R. Turner, and J. Peters, “Invariant models for causal transfer learning,” Journal of Machine Learning Research , vol. 19, no. 36, 2018
2018
Later among the works it cites.
S. Magliacane, T. van Ommen, T. Claassen, S. Bongers, P. Versteeg, and J. M. Mooij, “Domain adaptation by using causal inference to predict invariant conditional distributions,” in Advances in Neural Information Processing Systems , 2018, pp. 10 846–10 856
2018
Later among the works it cites.
V. Cheplygina, M. de Bruijne, and J. P. Pluim, “Not-so-supervised: a survey of semi-supervised, multi-instance, and transfer learning in medical image analysis,” Medical Image Analysis , 2019
2019
Closest in time.
W. M. Kouw, S. N. Ørting, J. Petersen, K. S. Pedersen, and M. de Bruijne, “A cross-center smoothness prior for variational Bayesian brain tissue segmentation,” in Conference on Information Processing in Medical Imaging , vol. 26, 2019, pp. 360 – 371
2019
Closest in time.
S. A. Friedler, C. Scheidegger, S. Venkatasubramanian, S. Choudhary, E. P. Hamilton, and D. Roth, “A comparative study of fairness-enhancing interventions in machine learning,” in Conference on Fairness, Accountability, and Transparency , 2019, pp. 329–338
2019
Closest in time.
K. Azizzadenesheli, A. Liu, F. Yang, and A. Anandkumar, “Regularized learning for domain adaptation under label shifts,” in International Conference on Learning Representations , 2019
2019
Closest in time.
W. Zellinger, B. A. Moser, T. Grubinger, E. Lughofer, T. Natschläger, and S. Saminger-Platz, “Robust unsupervised domain adaptation for neural networks via moment alignment,” Information Sciences , 2019
2019
Closest in time.
2019
Closest in time.
Z. Wang, Z. Dai, B. Póczos, and J. Carbonell, “Characterizing and avoiding negative transfer,” in Conference on Computer Vision and Pattern Recognition , 2019, pp. 11 293–11 302
2019
Closest in time.
W. Hu, G. Niu, I. Sato, and M. Sugiyama, “Does distributionally robust supervised learning give robust classifiers?” in International Conference on Machine Learning , 2018, pp. 2034–2042
2042
Closest in time.
B. Gong, Y. Shi, F. Sha, and K. Grauman, “Geodesic flow kernel for unsupervised domain adaptation,” in Conference on Computer Vision and Pattern Recognition , 2012, pp. 2066–2073
2073
Closest in time.
N. Srivastava and R. R. Salakhutdinov, “Discriminative transfer learning with tree-based priors,” in Advances in Neural Information Processing Systems , 2013, pp. 2094–2102
2094
Closest in time.
J. Zheng, M.-Y. Liu, R. Chellappa, and P. J. Phillips, “A Grassmann manifold-based domain adaptation approach,” in International Conference on Pattern Recognition , 2012, pp. 2095–2099
2099
Closest in time.