{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:31:33Z","timestamp":1740123093348,"version":"3.37.3"},"reference-count":83,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T00:00:00Z","timestamp":1639353600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1740850","IIS-1703331","CCF-2023495"],"award-info":[{"award-number":["CCF-1740850","IIS-1703331","CCF-2023495"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"name":"The Institute for Data Valorisation"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2022,8]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Statistical relational learning (SRL) frameworks are effective at defining probabilistic models over complex relational data. They often use weighted first-order logical rules where the weights of the rules govern probabilistic interactions and are usually learned from data. Existing weight learning approaches typically attempt to learn a set of weights that maximizes some function of data likelihood; however, this does not always translate to optimal performance on a desired domain metric, such as accuracy or F1 score. In this paper, we introduce a taxonomy of search-based weight learning approaches for SRL frameworks that directly optimize weights on a chosen domain performance metric. To effectively apply these search-based approaches, we introduce a novel projection, referred to as scaled space (SS), that is an accurate representation of the true weight space. We show that SS removes redundancies in the weight space and captures the semantic distance between the possible weight configurations. In order to improve the efficiency of search, we also introduce an approximation of SS which simplifies the process of sampling weight configurations. We demonstrate these approaches on two state-of-the-art SRL frameworks: Markov logic networks and probabilistic soft logic. We perform empirical evaluation on five real-world datasets and evaluate them each on two different metrics. We also compare them against four other weight learning approaches. Our experimental results show that our proposed search-based approaches outperform likelihood-based approaches and yield up to a 10% improvement across a variety of performance metrics. Further, we perform an extensive evaluation to measure the robustness of our approach to different initializations and hyperparameters. The results indicate that our approach is both accurate and robust.<\/jats:p>","DOI":"10.1007\/s10994-021-06069-5","type":"journal-article","created":{"date-parts":[[2021,12,13]],"date-time":"2021-12-13T21:43:36Z","timestamp":1639431816000},"page":"2799-2838","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A taxonomy of weight learning methods for statistical relational learning"],"prefix":"10.1007","volume":"111","author":[{"given":"Sriram","family":"Srinivasan","sequence":"first","affiliation":[]},{"given":"Charles","family":"Dickens","sequence":"additional","affiliation":[]},{"given":"Eriq","family":"Augustine","sequence":"additional","affiliation":[]},{"given":"Golnoosh","family":"Farnadi","sequence":"additional","affiliation":[]},{"given":"Lise","family":"Getoor","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,12,13]]},"reference":[{"key":"6069_CR1","doi-asserted-by":"crossref","unstructured":"Ahmadi, B., Kersting, K., & Natarajan, S. (2012). Lifted online training of relational models with stochastic gradient methods. In European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases.","DOI":"10.1007\/978-3-642-33460-3_43"},{"key":"6069_CR2","doi-asserted-by":"crossref","unstructured":"Alshukaili, D., Fernandes, A. A. A., & Paton, N. W. (2016). Structuring linked data search results using probabilistic soft logic. In The International Semantic Web Conference.","DOI":"10.1007\/978-3-319-46523-4_1"},{"key":"6069_CR3","first-page":"109:1","volume":"18","author":"SH Bach","year":"2017","unstructured":"Bach, S. H., Broecheler, M., Huang, B., & Getoor, L. (2017). Hinge-loss Markov random fields and probabilistic soft logic. Journal of Machine Learning Research, 18, 109:1-109:67.","journal-title":"Journal of Machine Learning Research"},{"key":"6069_CR4","unstructured":"Bach, S. H., Huang, B., London, B., & Getoor, L. (2013). Hinge-loss Markov random fields: Convex inference for structured prediction. In The Conference on Uncertainty in Artificial Intelligence."},{"key":"6069_CR5","unstructured":"Beltagy, I., Chau, C., Boleda, G., Garrette, D., Erk, K., & Mooney, R. (2013). Montague meets Markov: Deep semantics with probabilistic logical form. In Second Joint Conference on Lexical and Computational Semantics."},{"key":"6069_CR6","first-page":"281","volume":"13","author":"J Bergstra","year":"2012","unstructured":"Bergstra, J., & Bengio, Y. (2012). Random search for hyper-parameter optimization. Journal of Machine Learning Research, 13, 281\u2013305.","journal-title":"Journal of Machine Learning Research"},{"key":"6069_CR7","unstructured":"Bergstra, J. S., Bardenet, R., Bengio, Y., & K\u00e9gl, B. (2011). Algorithms for hyper-parameter optimization. In The Neural Information Processing Systems."},{"key":"6069_CR8","first-page":"179","volume":"24","author":"J Besag","year":"1975","unstructured":"Besag, J. (1975). Statistical analysis of non-lattice data. Journal of the Royal Statistical Society, 24, 179\u2013195.","journal-title":"Journal of the Royal Statistical Society"},{"key":"6069_CR9","doi-asserted-by":"crossref","unstructured":"Boyd, S. P., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011). Distributed optimization and statistical learning via the alternating direction method of multipliers. Foundations and trends. Machine Learning.","DOI":"10.1561\/9781601984616"},{"key":"6069_CR10","unstructured":"Brochu, E., Brochu, T., & de\u00a0Freitas, N. (2010). A Bayesian interactive optimization approach to procedural animation design. In The ACM Special Interest Group on Computer Graphics and Interactive Techniques."},{"issue":"2","key":"6069_CR11","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TKDE.2016.2625251","volume":"29","author":"H Chen","year":"2017","unstructured":"Chen, H., Ku, W., Wang, H., Tang, L., & Sun, M. (2017). Scaling up Markov logic probabilistic inference for social graphs. IEEE Transactions on Knowledge and Data Engineering, 29(2), 433\u2013445.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"6069_CR12","doi-asserted-by":"crossref","unstructured":"Choi, J., Choi, C., Lee, E., & Kim, P. (2015). Markov logic network based social relation inference for personalized social search. In New trends in computational collective intelligence (pp. 195\u2013202). Springer.","DOI":"10.1007\/978-3-319-10774-5_19"},{"key":"6069_CR13","doi-asserted-by":"crossref","unstructured":"Chou, L., Sarkhel, S., Ruozzi, N., & Gogate, V. (2016). On parameter tying by quantization. In The Association for the Advancement of Artificial Intelligence.","DOI":"10.1609\/aaai.v30i1.10429"},{"key":"6069_CR14","doi-asserted-by":"crossref","unstructured":"Chowdhury, R., Srinivasan, S., & Getoor, L. (2020). Joint estimation of user and publisher credibility for fake news detection. In The Conference on Information and Knowledge Management.","DOI":"10.1145\/3340531.3412066"},{"key":"6069_CR15","unstructured":"Claesen, M., & De\u00a0Moor, B. (2015). Hyperparameter search in machine learning. arXiv:1502.02127."},{"key":"6069_CR16","doi-asserted-by":"crossref","unstructured":"Collins, M. (2002). Discriminative training methods for hidden Markov models: Theory and experiments with perceptron algorithms. In Empirical Methods in Natural Language Processing.","DOI":"10.3115\/1118693.1118694"},{"key":"6069_CR17","doi-asserted-by":"crossref","unstructured":"Das, M., Dhami, D. S., Kunapuli, G., Kersting, K., & Natarajan, S. (2019). Fast relational probabilistic inference and learning: Approximate counting via hypergraphs. In The Association for the Advancement of Artificial Intelligence.","DOI":"10.1609\/aaai.v33i01.33017816"},{"key":"6069_CR18","doi-asserted-by":"crossref","unstructured":"Das, M., Wu, Y., Khot, T., Kersting, K., & Natarajan, S. (2016). Scaling lifted probabilistic inference and learning via graph databases. In SIAM International Conference on Data Mining.","DOI":"10.1137\/1.9781611974348.83"},{"key":"6069_CR19","doi-asserted-by":"crossref","unstructured":"De Raedt, L., & Kersting, K. (2011). Statistical relational learning. In Encyclopedia of machine learning (pp. 916\u2013924). Springer.","DOI":"10.1007\/978-0-387-30164-8_786"},{"key":"6069_CR20","unstructured":"De Raedt, L., Kimmig, A., & Toivonen, H. (2007). Problog: A probabilistic prolog and its application in link discovery. In The International Joint Conference on Artificial Intelligence."},{"key":"6069_CR21","doi-asserted-by":"crossref","unstructured":"Ebrahimi, J., Dou, D., & Lowd, D. (2016). Weakly supervised tweet stance classification by relational bootstrapping. In Empirical Methods in Natural Language Processing.","DOI":"10.18653\/v1\/D16-1105"},{"key":"6069_CR22","unstructured":"Farabi, K. M. A., Sarkhel, S., & Venugopal, D. (2018). Efficient weight learning in high-dimensional untied mlns. In Society for Artificial Intelligence and Statistics."},{"key":"6069_CR23","doi-asserted-by":"crossref","unstructured":"Farnadi, G., Bach, S. H., Moens, M., Getoor, L., & Cock, M. D. (2017). Soft quantification in statistical relational learning. Machine Learning Journal.","DOI":"10.1007\/s10994-017-5647-3"},{"issue":"3","key":"6069_CR24","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1017\/S1471068414000076","volume":"15","author":"D Fierens","year":"2015","unstructured":"Fierens, D., Van den Broeck, G., Renkens, J., Shterionov, D., Gutmann, B., Thon, I., Janssens, G., & De Raedt, L. (2015). Inference and learning in probabilistic logic programs using weighted boolean formulas. Theory and Practice of Logic Programming, 15(3), 358\u2013401.","journal-title":"Theory and Practice of Logic Programming"},{"key":"6069_CR25","unstructured":"Friedman, N., Getoor, L., Koller, D., & Pfeffer, A. (1999). Learning probabilistic relational models. In The International Joint Conference on Artificial Intelligence."},{"key":"6069_CR26","first-page":"299","volume":"2","author":"M Genton","year":"2001","unstructured":"Genton, M. (2001). Classes of kernels for machine learning: A statistics perspective. Journal of Machine Learning Research, 2, 299\u2013312.","journal-title":"Journal of Machine Learning Research"},{"key":"6069_CR27","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7432.001.0001","volume-title":"Introduction to statistical relational learning","author":"L Getoor","year":"2007","unstructured":"Getoor, L., & Taskar, B. (2007). Introduction to statistical relational learning. The MIT Press."},{"key":"6069_CR28","doi-asserted-by":"crossref","unstructured":"Goldberg, K., Roeder, T., Gupta, D., & Perkins, C. (2001). Eigentaste: A constant time collaborative filtering algorithm. Information Retrieval Journal, 4, 133\u2013151.","DOI":"10.1023\/A:1011419012209"},{"key":"6069_CR29","doi-asserted-by":"crossref","unstructured":"Huynh, T. N., & Mooney, R. (2009). Max-margin weight learning for Markov logic networks. In The ACM Special Interest Group on Knowledge Discovery and Data Mining.","DOI":"10.1007\/978-3-642-04180-8_54"},{"key":"6069_CR30","doi-asserted-by":"crossref","unstructured":"Huynh, T. N., & Mooney, R. J. (2010). Online max-margin weight learning with Markov logic networks. In The Association for the Advancement of Artificial Intelligence .","DOI":"10.1137\/1.9781611972818.55"},{"key":"6069_CR31","doi-asserted-by":"crossref","unstructured":"Islam, M.\u00a0M., Mohammad Al Farabi, K., Sarkhel, S., & Venugopal, D. (2018). Scaling up inference in mlns with spark. In Big data.","DOI":"10.1109\/BigData.2018.8622607"},{"key":"6069_CR32","unstructured":"Jaeger, M. (1997). Relational Bayesian networks. In The Conference on Uncertainty in Artificial Intelligence."},{"key":"6069_CR33","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10994-009-5108-8","volume":"77","author":"T Joachims","year":"2009","unstructured":"Joachims, T., Finley, T., & Yu, C.-N.J. (2009). Cutting-plane training of structural svms. Machine Learning Journal, 77, 27\u201359.","journal-title":"Machine Learning Journal"},{"key":"6069_CR34","doi-asserted-by":"crossref","unstructured":"Johnson, K., Lee, I., & Goldwasser, D. (2017). Ideological phrase indicators for classification of political discourse framing on twitter. In Workshop on NLP and Computational Social Science (NLP+CSS) at Association for Computational Linguistics. https:\/\/aclanthology.org\/venues\/nlpcss\/.","DOI":"10.18653\/v1\/W17-2913"},{"key":"6069_CR35","doi-asserted-by":"crossref","unstructured":"Kautz, H., Selman, B., & Jiang, Y. (1996). A general stochastic approach to solving problems with hard and soft constraints. In The Satisfiability Problem: Theory and Applications.","DOI":"10.1090\/dimacs\/035\/15"},{"key":"6069_CR36","doi-asserted-by":"crossref","unstructured":"Khot, T., Balasubramanian, N., Gribkoff, E., Sabharwal, A., Clark, P., & Etzioni, O. (2015). Exploring Markov logic networks for question answering. In Empirical Methods in Natural Language Processing.","DOI":"10.18653\/v1\/D15-1080"},{"key":"6069_CR37","doi-asserted-by":"crossref","unstructured":"Kok, S., & Domingos, P. (2005). Learning the Structure of Markov Logic Networks. In The International Conference on Machine Learning.","DOI":"10.1145\/1102351.1102407"},{"key":"6069_CR38","doi-asserted-by":"crossref","unstructured":"Kouki, P., Fakhraei, S., Foulds, J., Eirinaki, M., & Getoor, L. (2015). Hyper: A flexible and extensible probabilistic framework for hybrid recommender systems. In RecSys.","DOI":"10.1145\/2792838.2800175"},{"key":"6069_CR39","doi-asserted-by":"crossref","unstructured":"Kouki, P., Pujara, J., Marcum, C., Koehly, L.\u00a0M., & Getoor, L. (2017). Collective entity resolution in familial networks. In The IEEE International Conference on Data Mining.","DOI":"10.1109\/ICDM.2017.32"},{"issue":"1","key":"6069_CR40","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1115\/1.3653121","volume":"86","author":"HJ Kushner","year":"1964","unstructured":"Kushner, H. J. (1964). A new method of locating the maximum point of an arbitrary multipeak curve in the presence of noise. Journal of Basic Engineering, 86(1), 97\u2013106.","journal-title":"Journal of Basic Engineering"},{"key":"6069_CR41","unstructured":"Lacoste-Julien, S., Jaggi, M., Schmidt, M., & Pletscher, P. (2013). Block-coordinate Frank\u2013Wolfe optimization for structural svms. In The International Conference on Machine Learning."},{"key":"6069_CR42","doi-asserted-by":"crossref","unstructured":"Lalithsena, S., Perera, S., Kapanipathi, P., & Sheth, A. P. (2017). Domain-specific hierarchical subgraph extraction: A recommendation use case. In Big data.","DOI":"10.1109\/BigData.2017.8257982"},{"key":"6069_CR43","first-page":"1","volume":"18","author":"L Li","year":"2018","unstructured":"Li, L., Jamieson, K., DeSalvo, G., Rostamizadeh, A., & Talwalkar, A. (2018). Hyperband: A novel bandit-based approach to hyperparameter optimization. Journal of Machine Learning Research, 18, 1\u201352.","journal-title":"Journal of Machine Learning Research"},{"key":"6069_CR44","unstructured":"Lizotte, D., Wang, T., Bowling, M., & Schuurmans, D. (2007). Automatic gait optimization with Gaussian process regression. In The International Joint Conference on Artificial Intelligence."},{"key":"6069_CR45","doi-asserted-by":"crossref","unstructured":"Lowd, D., & Domingos, P. (2007). Efficient weight learning for Markov logic networks. In The ACM Special Interest Group on Knowledge Discovery and Data Mining.","DOI":"10.1007\/978-3-540-74976-9_21"},{"issue":"2","key":"6069_CR46","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1214\/aoms\/1177692644","volume":"43","author":"G Marsaglia","year":"1972","unstructured":"Marsaglia, G. (1972). Choosing a point from the surface of a sphere. Annals of Mathematical Statistics, 43(2), 645\u2013646.","journal-title":"Annals of Mathematical Statistics"},{"issue":"2","key":"6069_CR47","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10514-009-9130-2","volume":"27","author":"R Martinez-Cantin","year":"2009","unstructured":"Martinez-Cantin, R., de Freitas, N., Brochu, E., Castellanos, J. A., & Doucet, A. (2009). A Bayesian exploration\u2013exploitation approach for optimal online sensing and planning with a visually guided mobile robot. Autonomous Robots, 27(2), 93\u2013103.","journal-title":"Autonomous Robots"},{"key":"6069_CR48","volume-title":"Spatial variation","author":"B Mat\u00e9rn","year":"1960","unstructured":"Mat\u00e9rn, B. (1960). Spatial variation. Springer."},{"key":"6069_CR49","unstructured":"McCallum, A. (2003). Efficiently inducing features of conditional random fields. In The Conference on Uncertainty in Artificial Intelligence."},{"key":"6069_CR50","unstructured":"Mehran Kazemi, S., Buchman, D., Kersting, K., Natarajan, S., & Poole, D. (2014). Relational logistic regression. In The Association for the Advancement of Artificial Intelligence."},{"key":"6069_CR51","doi-asserted-by":"crossref","unstructured":"Mihalkova, L., & Mooney, R. (2007). Bottom-up learning of Markov logic network structure. In The International Conference on Machine Learning.","DOI":"10.1145\/1273496.1273575"},{"key":"6069_CR52","unstructured":"Mockus, J. (1977). On Bayesian methods for seeking the extremum and their application. In IFIP congress."},{"key":"6069_CR53","unstructured":"Mockus, J., Tiesis, V., & Zilinskas, A. (1978). The application of Bayesian methods for seeking the extremum. In Towards Global Optimisation."},{"issue":"4","key":"6069_CR54","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1145\/377939.377946","volume":"2","author":"ME Muller","year":"1959","unstructured":"Muller, M. E. (1959). A note on a method for generating points uniformly on n-dimensional spheres. Communications of the ACM, 2(4), 19\u201320.","journal-title":"Communications of the ACM"},{"key":"6069_CR55","doi-asserted-by":"crossref","unstructured":"Natarajan, S., Khot, T., Kersting, K., Gutmann, B., & Shavlik, J. (2012). Gradient-based boosting for statistical relational learning: The relational dependency network case. Machine Learning Journal","DOI":"10.1007\/s10994-011-5244-9"},{"key":"6069_CR56","first-page":"653","volume":"8","author":"J Neville","year":"2007","unstructured":"Neville, J., & Jensen, D. (2007). Relational dependency networks. Journal of Machine Learning Research, 8, 653\u2013692.","journal-title":"Journal of Machine Learning Research"},{"key":"6069_CR57","first-page":"373","volume":"4","author":"F Niu","year":"2011","unstructured":"Niu, F., R\u00e9, C., Doan, A., & Shavlik, J. W. (2011). Tuffy: Scaling up statistical inference in Markov logic networks using an rdbms. Very Large Data Bases, 4, 373\u2013384.","journal-title":"Very Large Data Bases"},{"key":"6069_CR58","doi-asserted-by":"crossref","unstructured":"Noessner, J., Niepert, M., & Stuckenschmidt, H. (2013). Rockit: Exploiting parallelism and symmetry for map inference in statistical relational learning. In The Association for the Advancement of Artificial Intelligence.","DOI":"10.1609\/aaai.v27i1.8579"},{"key":"6069_CR59","unstructured":"Platanios, E., Poon, H., Mitchell, T. M., & Horvitz, E. J. (2017). Estimating accuracy from unlabeled data: A probabilistic logic approach. In The Neural Information Processing Systems."},{"key":"6069_CR60","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/0004-3702(93)90061-F","volume":"64","author":"D Poole","year":"1993","unstructured":"Poole, D. (1993). Probabilistic horn abduction and Bayesian networks. Artificial Intelligence, 64, 81\u2013129.","journal-title":"Artificial Intelligence"},{"key":"6069_CR61","unstructured":"Poon, H., & Domingos, P. (2006). Sound and efficient inference with probabilistic and deterministic dependencies. In The Association for the Advancement of Artificial Intelligence."},{"key":"6069_CR62","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3206.001.0001","volume-title":"Gaussian processes for machine learning (adaptive computation and machine learning)","author":"CE Rasmussen","year":"2005","unstructured":"Rasmussen, C. E., & Williams, C. K. I. (2005). Gaussian processes for machine learning (adaptive computation and machine learning). The MIT Press."},{"issue":"1\u20132","key":"6069_CR63","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10994-006-5833-1","volume":"62","author":"M Richardson","year":"2006","unstructured":"Richardson, M., & Domingos, P. M. (2006). Markov logic networks. Machine Learning Journal, 62(1\u20132), 107\u2013136.","journal-title":"Machine Learning Journal"},{"key":"6069_CR64","unstructured":"Sarkhel, S., Singla, P., & Gogate, V. (2015). Fast lifted map inference via partitioning. In The Neural Information Processing Systems."},{"key":"6069_CR65","doi-asserted-by":"crossref","unstructured":"Sarkhel, S., Venugopal, D., Pham, T. A., Singla, P., & Gogate, V. (2016). Scalable training of Markov logic networks using approximate counting. In The Association for the Advancement of Artificial Intelligence.","DOI":"10.1609\/aaai.v30i1.10119"},{"key":"6069_CR66","doi-asserted-by":"crossref","unstructured":"Sato, T. (1995). A statistical learning method for logic programs with distribution semantics. In International Conference on Logic Programming.","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"6069_CR67","volume-title":"Learning with kernels: Support vector machines, regularization, optimization, and beyond","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., & Smola, A. (2002). Learning with kernels: Support vector machines, regularization, optimization, and beyond. MIT Press."},{"issue":"1","key":"6069_CR68","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1109\/JPROC.2015.2494218","volume":"104","author":"B Shahriari","year":"2016","unstructured":"Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016). Taking the human out of the loop: A review of Bayesian optimization. Proceedings of the IEEE, 104(1), 148\u2013175.","journal-title":"Proceedings of the IEEE"},{"key":"6069_CR69","unstructured":"Shavlik, J., & Natarajan, S. (2009). Speeding up inference in Markov logic networks by preprocessing to reduce the size of the resulting grounded network. In The International Joint Conference on Artificial Intelligence."},{"key":"6069_CR70","unstructured":"Shu, J., Lao, N., & Xing, E. (2010). Grafting-Light: Fast, Incremental Feature Selection and Structure Learning of Markov Random Fields. In The ACM Special Interest Group on Knowledge Discovery and Data Mining."},{"key":"6069_CR71","unstructured":"Singla, P., & Domingos, P. (2005). Discriminative training of Markov logic networks. In The Association for the Advancement of Artificial Intelligence."},{"key":"6069_CR72","unstructured":"Snoek, J., Larochelle, H., & Adams, R. P. (2012). Practical Bayesian optimization of machine learning algorithms. In The Neural Information Processing Systems."},{"issue":"20","key":"6069_CR73","doi-asserted-by":"publisher","first-page":"3175","DOI":"10.1093\/bioinformatics\/btw342","volume":"32","author":"D Sridhar","year":"2016","unstructured":"Sridhar, D., Fakhraei, S., & Getoor, L. (2016). A probabilistic approach for collective similarity-based drug\u2013drug interaction prediction. Bioinformatics, 32(20), 3175\u20133182.","journal-title":"Bioinformatics"},{"key":"6069_CR74","unstructured":"Srinivas, N., Krause, A., Kakade, S., & Seeger, M. (2010). Gaussian process optimization in the bandit setting: No regret and experimental design. In The International Conference on Machine Learning."},{"key":"6069_CR75","doi-asserted-by":"publisher","first-page":"3250","DOI":"10.1109\/TIT.2011.2182033","volume":"58","author":"N Srinivas","year":"2012","unstructured":"Srinivas, N., Krause, A., Kakade, S. M., & Seeger, M. W. (2012). Information-theoretic regret bounds for Gaussian process optimization in the bandit setting. IEEE Transactions on Information Theory, 58, 3250\u20133265.","journal-title":"IEEE Transactions on Information Theory"},{"key":"6069_CR76","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Augustine, E., & Getoor, L. (2020a). Tandem inference: An out-of-core streaming algorithm for very large-scale relational inference. In The Association for the Advancement of Artificial Intelligence.","DOI":"10.1609\/aaai.v34i06.6588"},{"key":"6069_CR77","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Farnadi, G., & Getoor, L. (2020b). BOWL: Bayesian optimization for weight learning in probabilistic soft logic. In The Association for the Advancement of Artificial Intelligence.","DOI":"10.1609\/aaai.v34i06.6589"},{"key":"6069_CR78","doi-asserted-by":"crossref","unstructured":"Srinivasan, S., Rao, N., Subbian, K., & Getoor, L. (2019). Identifying facet mismatches in search via micrographs. In The Conference on Information and Knowledge Management.","DOI":"10.1145\/3357384.3357911"},{"key":"6069_CR79","unstructured":"Taskar, B., Abbeel, P., & Koller, D. (2002). Discriminative probabilistic models for relational data. In The Conference on Uncertainty in Artificial Intelligence."},{"issue":"3\u20134","key":"6069_CR80","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/biomet\/25.3-4.285","volume":"25","author":"W Thompson","year":"1933","unstructured":"Thompson, W. (1933). On the likelihood that one unknown probability exceeds another in view of the evidence of two samples. Biometrika, 25(3\u20134), 285\u2013294.","journal-title":"Biometrika"},{"key":"6069_CR81","doi-asserted-by":"crossref","unstructured":"Van Haaren, J., Van den Broeck, G., Mert, W., & Davis, J. (2015). Lifted generative learning of Markov logic networks. Machine Learning Journal.","DOI":"10.1007\/s10994-015-5532-x"},{"key":"6069_CR82","unstructured":"Venugopal, D., Sarkhel, S., & Gogate, V. (2016). Magician: Scalable inference and learning in Markov logic using approximate symmetries. UofM, Memphis: Technical report."},{"issue":"1","key":"6069_CR83","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1613\/jair.4806","volume":"55","author":"Z Wang","year":"2016","unstructured":"Wang, Z., Hutter, F., Zoghi, M., Matheson, D., & De Freitas, N. (2016). Bayesian optimization in a billion dimensions via random embeddings. Journal of Artificial Intelligence Research, 55(1), 361\u2013387.","journal-title":"Journal of Artificial Intelligence Research"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06069-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10994-021-06069-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-021-06069-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,14]],"date-time":"2024-09-14T10:04:02Z","timestamp":1726308242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10994-021-06069-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,13]]},"references-count":83,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,8]]}},"alternative-id":["6069"],"URL":"https:\/\/doi.org\/10.1007\/s10994-021-06069-5","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2021,12,13]]},"assertion":[{"value":"27 June 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2021","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 September 2021","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 December 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}