Fetching the paper…
Reading the bibliography…
This paper addresses the general problem of domain adaptation which arises in a variety of applications where the distribution of the labeled sample available somewhat differs from that of the test data.
A theory of the learnable
Valiant][1984]valiant Valiant, L. G. (1984) · 1984
Earlier work this paper cites.
On minimizing the maximum eigenvalue of a symmetric matrix
Fletcher][1985]fletcher Fletcher, R. (1985) · 1985
Earlier work this paper cites.
On minimizing the maximum eigenvalue of a symmetric matrix
Overton][1988]overton Overton, M. L. (1988) · 1988
Earlier work this paper cites.
Probability in Banach spaces: isoperimetry and processes
Ledoux and Talagrand][1991]talagrand Ledoux, M., & Talagrand, M. (1991) · 1991
Earlier work this paper cites.
Adaptive language modeling using minimum discriminant estimation
Pietra et al.][1992]DellaPietra Pietra, S. D., Pietra, V. D., Mercer, R. L., & Roukos, S. (1992) · 1992
Earlier work this paper cites.
An interior-point method for minimizing the maximum eigenvalue of a linear combination of matrices
Jarre][1993]jarre Jarre, F. (1993) · 1993
Earlier work this paper cites.
Maximum a posteriori estimation for multivariate gaussian mixture observations of markov chains
Gauvain and Chin-Hui][1994]GauvainLee Gauvain, J.-L., & Chin-Hui (1994) · 1994
Earlier work this paper cites.
Interior point polynomial methods in convex programming: Theory and applications
Nesterov and Nemirovsky][1994]nesterov Nesterov, Y., & Nemirovsky, A. (1994) · 1994
Earlier work this paper cites.
Interior point methods in semidefinite programming with applications to combinatorial optimization
Alizadeh][1995]alizadeh Alizadeh, F. (1995) · 1995
Earlier work this paper cites.
Support-Vector Networks
Cortes and Vapnik][1995]ccvv Cortes, C., & Vapnik, V. (1995) · 1995
Earlier work this paper cites.
Maximum likelihood linear regression for speaker adaptation of continuous density hidden markov models
Legetter and Woodland][1995]LegetterWoodlang Legetter, C. J., & Woodland, P. C. (1995) · 1995
Earlier work this paper cites.
A probabilistic theory of pattern recognition
Devroye et al.][1996]devroye Devroye, L., Györfi, L., & Lugosi, G. (1996) · 1996
Earlier work this paper cites.
A Maximum Entropy Approach to Adaptive Statistical Language Modeling
Rosenfeld][1996]Rosenfeld96 Rosenfeld, R. (1996) · 1996
Cited alongside, same era.
Statistical Methods for Speech Recognition
Jelinek][1998]jelinek Jelinek, F. (1998) · 1998
Cited alongside, same era.
Ridge Regression Learning Algorithm in Dual Variables
Saunders et al.][1998]krr Saunders, C., Gammerman, A., & Vovk, V. (1998) · 1998
Cited alongside, same era.
Statistical learning theory
Vapnik][1998]vapnik98 Vapnik, V. N. (1998) · 1998
Cited alongside, same era.
The discrepancy method: randomness and complexity
Chazelle][2000]chazelle Chazelle, B. (2000) · 2000
Cited alongside, same era.
Bundle methods to minimize the maximum eigenvalue function
Helmberg and Oustry][2000]helmberg Helmberg, C., & Oustry, F. (2000) · 2000
Cited alongside, same era.
Supervised and unsupervised PCFG adaptation to novel domains
Roark and Bacchiani][2003]roark03supervised Roark, B., & Bacchiani, M. (2003) · 2003
Later among the works it cites.
Detecting change in data streams
Kifer et al.][2004]kifer Kifer, D., Ben-David, S., & Gehrke, J. (2004) · 2004
Later among the works it cites.
Analysis of representations for domain adaptation
Ben-David et al.][2007]bendavid Ben-David, S., Blitzer, J., Crammer, K., & Pereira, F. (2007) · 2006
Later among the works it cites.
Adaptation of maximum entropy capitalizer: Little data can help a lot
Chelba and Acero][2006]chelba Chelba, C., & Acero, A. (2006) · 2006
Later among the works it cites.
Domain adaptation for statistical classifiers
Daumé III and Marcu][2006]daume06 Daumé III, H., & Marcu, D. (2006) · 2006
Later among the works it cites.
Learning bounds for domain adaptation
Blitzer et al.][2008]blitzer Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., & Wortman, J. (2008) · 2007
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Rademacher processes and bounding the risk of function learning
Koltchinskii and Panchenko][2000]koltchinskii_and_panchenko Koltchinskii, V., & Panchenko, D. (2000) · 2000
Cited alongside, same era.
The foundations of cost-sensitive learning
Elkan][2001]elkan Elkan, C. (2001) · 2001
Cited alongside, same era.
A min-max-sum resource allocation problem and its application
Karabati et al.][2001]kouvelis Karabati, S., Kouvelis, P., & Yu, G. (2001) · 2001
Cited alongside, same era.
Rademacher and Gaussian complexities: Risk bounds and structural results
Bartlett and Mendelson][2002]bartlett Bartlett, P. L., & Mendelson, S. (2002) · 2002
Cited alongside, same era.
Stability and generalization
Bousquet and Elisseeff][2002]bousquet-jmlr Bousquet, O., & Elisseeff, A. (2002) · 2002
Cited alongside, same era.
Recognizing imprecisely localized, partially occluded, and expression variant faces from a single sample per class
Martínez][2002]martinez Martínez, A. M. (2002) · 2002
Cited alongside, same era.
Later among the works it cites.
Biographies, Bollywood, Boom-boxes and Blenders: Domain Adaptation for Sentiment Classification
Blitzer et al.][2007]Blitzer07Biographies Blitzer, J., Dredze, M., & Pereira, F. (2007) · 2007
Later among the works it cites.
Frustratingly Hard Domain Adaptation for Parsing
Dredze et al.][2007]Dredze07Frustratingly Dredze, M., Blitzer, J., Talukdar, P. P., Ganchev, K., Graca, J., & Pereira, F. (2007) · 2007
Later among the works it cites.
Instance Weighting for Domain Adaptation in NLP
Jiang and Zhai][2007]jiang-zhai07 Jiang, J., & Zhai, C. (2007) · 2007
Later among the works it cites.
Sample selection bias correction theory
Cortes et al.][2008]bias Cortes, C., Mohri, M., Riley, M., & Rostamizadeh, A. (2008) · 2008
Later among the works it cites.
Domain adaptation with multiple sources
Mansour et al.][2009]nips09 Mansour, Y., Mohri, M., & Rostamizadeh, A. (2009) · 2008
Later among the works it cites.