[{"publication_status":"published","language":[{"iso":"eng"}],"volume":42,"issue":"3","abstract":[{"text":"The paper describes a generalized iterative proportional fitting procedure that can be used for maximum likelihood estimation in a special class of the general log-linear model. The models in this class, called relational, apply to multivariate discrete sample spaces that do not necessarily have a Cartesian product structure and may not contain an overall effect. When applied to the cell probabilities, the models without the overall effect are curved exponential families and the values of the sufficient statistics are reproduced by the MLE only up to a constant of proportionality. The paper shows that Iterative Proportional Fitting, Generalized Iterative Scaling, and Improved Iterative Scaling fail to work for such models. The algorithm proposed here is based on iterated Bregman projections. As a by-product, estimates of the multiplicative parameters are also obtained. An implementation of the algorithm is available as an R-package.","lang":"eng"}],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1307.3282"}],"scopus_import":1,"intvolume":" 42","month":"09","date_updated":"2021-01-12T06:54:41Z","department":[{"_id":"CaUh"}],"_id":"2008","type":"journal_article","status":"public","year":"2015","publication":"Scandinavian Journal of Statistics","day":"01","page":"832 - 847","date_created":"2018-12-11T11:55:11Z","doi":"10.1111/sjos.12139","date_published":"2015-09-01T00:00:00Z","acknowledgement":"Part of the material presented here was contained in the PhD thesis of the first author to which the second author and Thomas Richardson were advisers. The authors wish to thank him for several comments and suggestions. We also thank the reviewers and the Associate Editor for helpful comments. The proof of Proposition 1 uses the idea of Olga Klimova, to whom the authors are also indebted. The second author was supported in part by Grant K-106154 from the Hungarian National Scientific Research Fund (OTKA).","oa":1,"quality_controlled":"1","publisher":"Wiley","citation":{"mla":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” Scandinavian Journal of Statistics, vol. 42, no. 3, Wiley, 2015, pp. 832–47, doi:10.1111/sjos.12139.","ama":"Klimova A, Rudas T. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 2015;42(3):832-847. doi:10.1111/sjos.12139","apa":"Klimova, A., & Rudas, T. (2015). Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. Wiley. https://doi.org/10.1111/sjos.12139","short":"A. Klimova, T. Rudas, Scandinavian Journal of Statistics 42 (2015) 832–847.","ieee":"A. Klimova and T. Rudas, “Iterative scaling in curved exponential families,” Scandinavian Journal of Statistics, vol. 42, no. 3. Wiley, pp. 832–847, 2015.","chicago":"Klimova, Anna, and Tamás Rudas. “Iterative Scaling in Curved Exponential Families.” Scandinavian Journal of Statistics. Wiley, 2015. https://doi.org/10.1111/sjos.12139.","ista":"Klimova A, Rudas T. 2015. Iterative scaling in curved exponential families. Scandinavian Journal of Statistics. 42(3), 832–847."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Klimova, Anna","last_name":"Klimova","first_name":"Anna","id":"31934120-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Tamás","last_name":"Rudas","full_name":"Rudas, Tamás"}],"publist_id":"5068","title":"Iterative scaling in curved exponential families"},{"oa_version":"Preprint","abstract":[{"text":"The monotone secant conjecture posits a rich class of polynomial systems, all of whose solutions are real. These systems come from the Schubert calculus on flag manifolds, and the monotone secant conjecture is a compelling generalization of the Shapiro conjecture for Grassmannians (Theorem of Mukhin, Tarasov, and Varchenko). We present some theoretical evidence for this conjecture, as well as computational evidence obtained by 1.9 teraHertz-years of computing, and we discuss some of the phenomena we observed in our data. ","lang":"eng"}],"intvolume":" 24","month":"06","main_file_link":[{"url":"http://arxiv.org/abs/1109.3436","open_access":"1"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","volume":24,"issue":"3","_id":"2006","status":"public","type":"journal_article","date_updated":"2021-01-12T06:54:40Z","department":[{"_id":"CaUh"}],"oa":1,"quality_controlled":"1","publisher":"Taylor & Francis","publication":"Experimental Mathematics","day":"23","year":"2015","date_created":"2018-12-11T11:55:10Z","date_published":"2015-06-23T00:00:00Z","doi":"10.1080/10586458.2014.980044","page":"261 - 269","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Hein, N., Hillar, C., Martin del Campo Sanchez, A., Sottile, F., & Teitler, Z. (2015). The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. Taylor & Francis. https://doi.org/10.1080/10586458.2014.980044","ama":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. 2015;24(3):261-269. doi:10.1080/10586458.2014.980044","short":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, Z. Teitler, Experimental Mathematics 24 (2015) 261–269.","ieee":"N. Hein, C. Hillar, A. Martin del Campo Sanchez, F. Sottile, and Z. Teitler, “The monotone secant conjecture in the real Schubert calculus,” Experimental Mathematics, vol. 24, no. 3. Taylor & Francis, pp. 261–269, 2015.","mla":"Hein, Nicolas, et al. “The Monotone Secant Conjecture in the Real Schubert Calculus.” Experimental Mathematics, vol. 24, no. 3, Taylor & Francis, 2015, pp. 261–69, doi:10.1080/10586458.2014.980044.","ista":"Hein N, Hillar C, Martin del Campo Sanchez A, Sottile F, Teitler Z. 2015. The monotone secant conjecture in the real Schubert calculus. Experimental Mathematics. 24(3), 261–269.","chicago":"Hein, Nicolas, Christopher Hillar, Abraham Martin del Campo Sanchez, Frank Sottile, and Zach Teitler. “The Monotone Secant Conjecture in the Real Schubert Calculus.” Experimental Mathematics. Taylor & Francis, 2015. https://doi.org/10.1080/10586458.2014.980044."},"title":"The monotone secant conjecture in the real Schubert calculus","article_processing_charge":"No","author":[{"full_name":"Hein, Nicolas","last_name":"Hein","first_name":"Nicolas"},{"first_name":"Christopher","last_name":"Hillar","full_name":"Hillar, Christopher"},{"id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","first_name":"Abraham","last_name":"Martin Del Campo Sanchez","full_name":"Martin Del Campo Sanchez, Abraham"},{"first_name":"Frank","full_name":"Sottile, Frank","last_name":"Sottile"},{"first_name":"Zach","last_name":"Teitler","full_name":"Teitler, Zach"}],"publist_id":"5070"},{"scopus_import":1,"quality_controlled":"1","publisher":"Elsevier","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1404.6617"}],"oa":1,"month":"07","intvolume":" 87","abstract":[{"text":"The concepts of faithfulness and strong-faithfulness are important for statistical learning of graphical models. Graphs are not sufficient for describing the association structure of a discrete distribution. Hypergraphs representing hierarchical log-linear models are considered instead, and the concept of parametric (strong-) faithfulness with respect to a hypergraph is introduced. Strong-faithfulness ensures the existence of uniformly consistent parameter estimators and enables building uniformly consistent procedures for a hypergraph search. The strength of association in a discrete distribution can be quantified with various measures, leading to different concepts of strong-faithfulness. Lower and upper bounds for the proportions of distributions that do not satisfy strong-faithfulness are computed for different parameterizations and measures of association.","lang":"eng"}],"oa_version":"Preprint","page":"57 - 72","doi":"10.1016/j.csda.2015.01.017","issue":"7","date_published":"2015-07-01T00:00:00Z","volume":87,"date_created":"2018-12-11T11:55:13Z","publication_status":"published","year":"2015","day":"01","language":[{"iso":"eng"}],"publication":"Computational Statistics & Data Analysis","type":"journal_article","status":"public","_id":"2014","publist_id":"5062","author":[{"last_name":"Klimova","full_name":"Klimova, Anna","id":"31934120-F248-11E8-B48F-1D18A9856A87","first_name":"Anna"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline","last_name":"Uhler"},{"last_name":"Rudas","full_name":"Rudas, Tamás","first_name":"Tamás"}],"title":"Faithfulness and learning hypergraphs from discrete distributions","department":[{"_id":"CaUh"}],"citation":{"chicago":"Klimova, Anna, Caroline Uhler, and Tamás Rudas. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” Computational Statistics & Data Analysis. Elsevier, 2015. https://doi.org/10.1016/j.csda.2015.01.017.","ista":"Klimova A, Uhler C, Rudas T. 2015. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. 87(7), 57–72.","mla":"Klimova, Anna, et al. “Faithfulness and Learning Hypergraphs from Discrete Distributions.” Computational Statistics & Data Analysis, vol. 87, no. 7, Elsevier, 2015, pp. 57–72, doi:10.1016/j.csda.2015.01.017.","short":"A. Klimova, C. Uhler, T. Rudas, Computational Statistics & Data Analysis 87 (2015) 57–72.","ieee":"A. Klimova, C. Uhler, and T. Rudas, “Faithfulness and learning hypergraphs from discrete distributions,” Computational Statistics & Data Analysis, vol. 87, no. 7. Elsevier, pp. 57–72, 2015.","apa":"Klimova, A., Uhler, C., & Rudas, T. (2015). Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. Elsevier. https://doi.org/10.1016/j.csda.2015.01.017","ama":"Klimova A, Uhler C, Rudas T. Faithfulness and learning hypergraphs from discrete distributions. Computational Statistics & Data Analysis. 2015;87(7):57-72. doi:10.1016/j.csda.2015.01.017"},"date_updated":"2021-01-12T06:54:43Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"type":"journal_article","status":"public","_id":"1911","publist_id":"5183","author":[{"first_name":"Alexander","full_name":"Engström, Alexander","last_name":"Engström"},{"id":"46870C74-F248-11E8-B48F-1D18A9856A87","first_name":"Patrik","full_name":"Noren, Patrik","last_name":"Noren"}],"title":"Tverberg's Theorem and Graph Coloring","department":[{"_id":"CaUh"}],"citation":{"mla":"Engström, Alexander, and Patrik Noren. “Tverberg’s Theorem and Graph Coloring.” Discrete & Computational Geometry, vol. 51, no. 1, Springer, 2014, pp. 207–20, doi:10.1007/s00454-013-9556-3.","short":"A. Engström, P. Noren, Discrete & Computational Geometry 51 (2014) 207–220.","ieee":"A. Engström and P. Noren, “Tverberg’s Theorem and Graph Coloring,” Discrete & Computational Geometry, vol. 51, no. 1. Springer, pp. 207–220, 2014.","ama":"Engström A, Noren P. Tverberg’s Theorem and Graph Coloring. Discrete & Computational Geometry. 2014;51(1):207-220. doi:10.1007/s00454-013-9556-3","apa":"Engström, A., & Noren, P. (2014). Tverberg’s Theorem and Graph Coloring. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-013-9556-3","chicago":"Engström, Alexander, and Patrik Noren. “Tverberg’s Theorem and Graph Coloring.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-013-9556-3.","ista":"Engström A, Noren P. 2014. Tverberg’s Theorem and Graph Coloring. Discrete & Computational Geometry. 51(1), 207–220."},"date_updated":"2021-01-12T06:54:01Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","scopus_import":1,"month":"01","intvolume":" 51","abstract":[{"text":"The topological Tverberg theorem has been generalized in several directions by setting extra restrictions on the Tverberg partitions. Restricted Tverberg partitions, defined by the idea that certain points cannot be in the same part, are encoded with graphs. When two points are adjacent in the graph, they are not in the same part. If the restrictions are too harsh, then the topological Tverberg theorem fails. The colored Tverberg theorem corresponds to graphs constructed as disjoint unions of small complete graphs. Hell studied the case of paths and cycles. In graph theory these partitions are usually viewed as graph colorings. As explored by Aharoni, Haxell, Meshulam and others there are fundamental connections between several notions of graph colorings and topological combinatorics. For ordinary graph colorings it is enough to require that the number of colors q satisfy q>Δ, where Δ is the maximal degree of the graph. It was proven by the first author using equivariant topology that if q>Δ 2 then the topological Tverberg theorem still works. It is conjectured that q>KΔ is also enough for some constant K, and in this paper we prove a fixed-parameter version of that conjecture. The required topological connectivity results are proven with shellability, which also strengthens some previous partial results where the topological connectivity was proven with the nerve lemma.","lang":"eng"}],"oa_version":"None","acknowledgement":"Patrik Norén gratefully acknowledges support from the Wallenberg foundation","page":"207 - 220","date_published":"2014-01-01T00:00:00Z","doi":"10.1007/s00454-013-9556-3","issue":"1","volume":51,"date_created":"2018-12-11T11:54:40Z","publication_status":"published","year":"2014","day":"01","publication":"Discrete & Computational Geometry","language":[{"iso":"eng"}]},{"page":"133 - 141","date_created":"2018-12-11T11:55:12Z","volume":50,"doi":"10.1016/j.jbi.2014.01.008","date_published":"2014-08-01T00:00:00Z","publication_status":"published","year":"2014","publication":"Journal of Biomedical Informatics","language":[{"iso":"eng"}],"day":"01","oa":1,"main_file_link":[{"url":"http://arxiv.org/abs/1401.5193","open_access":"1"}],"quality_controlled":"1","scopus_import":1,"publisher":"Elsevier","intvolume":" 50","month":"08","abstract":[{"lang":"eng","text":"The protection of privacy of individual-level information in genome-wide association study (GWAS) databases has been a major concern of researchers following the publication of “an attack” on GWAS data by Homer et al. (2008). Traditional statistical methods for confidentiality and privacy protection of statistical databases do not scale well to deal with GWAS data, especially in terms of guarantees regarding protection from linkage to external information. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach that provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information, although the guarantees may come at a serious price in terms of data utility. Building on such notions, Uhler et al. (2013) proposed new methods to release aggregate GWAS data without compromising an individual’s privacy. We extend the methods developed in Uhler et al. (2013) for releasing differentially-private χ2χ2-statistics by allowing for arbitrary number of cases and controls, and for releasing differentially-private allelic test statistics. We also provide a new interpretation by assuming the controls’ data are known, which is a realistic assumption because some GWAS use publicly available data as controls. We assess the performance of the proposed methods through a risk-utility analysis on a real data set consisting of DNA samples collected by the Wellcome Trust Case Control Consortium and compare the methods with the differentially-private release mechanism proposed by Johnson and Shmatikov (2013)."}],"acknowledgement":"This research was partially supported by NSF Awards EMSW21-RTG and BCS-0941518 to the Department of Statistics at Carnegie Mellon University, and by NSF Grant BCS-0941553 to the Department of Statistics at Pennsylvania State University. This work was also supported in part by the National Center for Research Resources, Grant UL1 RR033184, and is now at the National Center for Advancing Translational Sciences, Grant UL1 TR000127 to Pennsylvania State University. The content is solely the responsibility of the authors and does not necessarily represent the official views of the NSF and NIH.","oa_version":"Submitted Version","author":[{"last_name":"Yu","full_name":"Yu, Fei","first_name":"Fei"},{"first_name":"Stephen","full_name":"Fienberg, Stephen","last_name":"Fienberg"},{"last_name":"Slaković","full_name":"Slaković, Alexandra","first_name":"Alexandra"},{"first_name":"Caroline","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216"}],"publist_id":"5065","title":"Scalable privacy-preserving data sharing methodology for genome-wide association studies","department":[{"_id":"CaUh"}],"citation":{"chicago":"Yu, Fei, Stephen Fienberg, Alexandra Slaković, and Caroline Uhler. “Scalable Privacy-Preserving Data Sharing Methodology for Genome-Wide Association Studies.” Journal of Biomedical Informatics. Elsevier, 2014. https://doi.org/10.1016/j.jbi.2014.01.008.","ista":"Yu F, Fienberg S, Slaković A, Uhler C. 2014. Scalable privacy-preserving data sharing methodology for genome-wide association studies. Journal of Biomedical Informatics. 50, 133–141.","mla":"Yu, Fei, et al. “Scalable Privacy-Preserving Data Sharing Methodology for Genome-Wide Association Studies.” Journal of Biomedical Informatics, vol. 50, Elsevier, 2014, pp. 133–41, doi:10.1016/j.jbi.2014.01.008.","ieee":"F. Yu, S. Fienberg, A. Slaković, and C. Uhler, “Scalable privacy-preserving data sharing methodology for genome-wide association studies,” Journal of Biomedical Informatics, vol. 50. Elsevier, pp. 133–141, 2014.","short":"F. Yu, S. Fienberg, A. Slaković, C. Uhler, Journal of Biomedical Informatics 50 (2014) 133–141.","apa":"Yu, F., Fienberg, S., Slaković, A., & Uhler, C. (2014). Scalable privacy-preserving data sharing methodology for genome-wide association studies. Journal of Biomedical Informatics. Elsevier. https://doi.org/10.1016/j.jbi.2014.01.008","ama":"Yu F, Fienberg S, Slaković A, Uhler C. Scalable privacy-preserving data sharing methodology for genome-wide association studies. Journal of Biomedical Informatics. 2014;50:133-141. doi:10.1016/j.jbi.2014.01.008"},"date_updated":"2021-01-12T06:54:42Z","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","_id":"2011"},{"title":"gIPFrm: Generalized iterative proportional fitting for relational models","department":[{"_id":"CaUh"}],"article_processing_charge":"No","author":[{"full_name":"Klimova, Anna","last_name":"Klimova","first_name":"Anna","id":"31934120-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rudas","full_name":"Rudas, Tamás","first_name":"Tamás"}],"publist_id":"5069","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ama":"Klimova A, Rudas T. gIPFrm: Generalized iterative proportional fitting for relational models. 2014.","apa":"Klimova, A., & Rudas, T. (2014). gIPFrm: Generalized iterative proportional fitting for relational models. The Comprehensive R Archive Network.","ieee":"A. Klimova and T. Rudas, “gIPFrm: Generalized iterative proportional fitting for relational models.” The Comprehensive R Archive Network, 2014.","short":"A. Klimova, T. Rudas, (2014).","mla":"Klimova, Anna, and Tamás Rudas. GIPFrm: Generalized Iterative Proportional Fitting for Relational Models. The Comprehensive R Archive Network, 2014.","ista":"Klimova A, Rudas T. 2014. gIPFrm: Generalized iterative proportional fitting for relational models, The Comprehensive R Archive Network.","chicago":"Klimova, Anna, and Tamás Rudas. “GIPFrm: Generalized Iterative Proportional Fitting for Relational Models.” The Comprehensive R Archive Network, 2014."},"date_updated":"2022-08-26T08:12:12Z","status":"public","type":"research_data_reference","_id":"2007","date_created":"2018-12-11T11:55:10Z","date_published":"2014-03-20T00:00:00Z","day":"20","year":"2014","month":"03","oa":1,"main_file_link":[{"open_access":"1","url":"https://CRAN.R-project.org/package=gIPFrm "}],"publisher":"The Comprehensive R Archive Network","oa_version":"Published Version","abstract":[{"text":"Maximum likelihood estimation under relational models, with or without the overall effect. For more information see the reference manual","lang":"eng"}]},{"year":"2014","day":"10","publication":"Foundations of Computational Mathematics","page":"1079 - 1116","date_published":"2014-10-10T00:00:00Z","doi":"10.1007/s10208-014-9205-0","date_created":"2018-12-11T11:55:12Z","acknowledgement":"This work was supported in part by the US National Science Foundation (DMS-0968882) and the Defense Advanced Research Projects Agency (DARPA) Deep Learning program (FA8650-10-C-7020).","quality_controlled":"1","publisher":"Springer","oa":1,"citation":{"ista":"Lin S, Uhler C, Sturmfels B, Bühlmann P. 2014. Hypersurfaces and their singularities in partial correlation testing. Foundations of Computational Mathematics. 14(5), 1079–1116.","chicago":"Lin, Shaowei, Caroline Uhler, Bernd Sturmfels, and Peter Bühlmann. “Hypersurfaces and Their Singularities in Partial Correlation Testing.” Foundations of Computational Mathematics. Springer, 2014. https://doi.org/10.1007/s10208-014-9205-0.","short":"S. Lin, C. Uhler, B. Sturmfels, P. Bühlmann, Foundations of Computational Mathematics 14 (2014) 1079–1116.","ieee":"S. Lin, C. Uhler, B. Sturmfels, and P. Bühlmann, “Hypersurfaces and their singularities in partial correlation testing,” Foundations of Computational Mathematics, vol. 14, no. 5. Springer, pp. 1079–1116, 2014.","apa":"Lin, S., Uhler, C., Sturmfels, B., & Bühlmann, P. (2014). Hypersurfaces and their singularities in partial correlation testing. Foundations of Computational Mathematics. Springer. https://doi.org/10.1007/s10208-014-9205-0","ama":"Lin S, Uhler C, Sturmfels B, Bühlmann P. Hypersurfaces and their singularities in partial correlation testing. Foundations of Computational Mathematics. 2014;14(5):1079-1116. doi:10.1007/s10208-014-9205-0","mla":"Lin, Shaowei, et al. “Hypersurfaces and Their Singularities in Partial Correlation Testing.” Foundations of Computational Mathematics, vol. 14, no. 5, Springer, 2014, pp. 1079–116, doi:10.1007/s10208-014-9205-0."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Shaowei","last_name":"Lin","full_name":"Lin, Shaowei"},{"last_name":"Uhler","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline"},{"first_name":"Bernd","full_name":"Sturmfels, Bernd","last_name":"Sturmfels"},{"full_name":"Bühlmann, Peter","last_name":"Bühlmann","first_name":"Peter"}],"publist_id":"5063","title":"Hypersurfaces and their singularities in partial correlation testing","publication_status":"published","language":[{"iso":"eng"}],"issue":"5","volume":14,"abstract":[{"text":"An asymptotic theory is developed for computing volumes of regions in the parameter space of a directed Gaussian graphical model that are obtained by bounding partial correlations. We study these volumes using the method of real log canonical thresholds from algebraic geometry. Our analysis involves the computation of the singular loci of correlation hypersurfaces. Statistical applications include the strong-faithfulness assumption for the PC algorithm and the quantification of confounder bias in causal inference. A detailed analysis is presented for trees, bow ties, tripartite graphs, and complete graphs.\r\n","lang":"eng"}],"oa_version":"Submitted Version","scopus_import":1,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1209.0285"}],"month":"10","intvolume":" 14","date_updated":"2021-01-12T06:54:43Z","department":[{"_id":"CaUh"}],"_id":"2013","type":"journal_article","status":"public"},{"day":"01","publication":"Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)","year":"2014","date_published":"2014-01-01T00:00:00Z","doi":"10.1007/978-3-319-11257-2_14","date_created":"2018-12-11T11:55:24Z","page":"170 - 184","acknowledgement":"This research was partially supported by BCS- 0941518 to the Department of Statistics at Carnegie Mellon University.","publisher":"Springer","quality_controlled":"1","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Yu F, Rybar M, Uhler C, Fienberg S. 2014. Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PSD: Privacy in Statistical Databases, LNCS, vol. 8744, 170–184.","chicago":"Yu, Fei, Michal Rybar, Caroline Uhler, and Stephen Fienberg. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” In Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Josep Domingo Ferrer, 8744:170–84. Springer, 2014. https://doi.org/10.1007/978-3-319-11257-2_14.","short":"F. Yu, M. Rybar, C. Uhler, S. Fienberg, in:, J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Springer, 2014, pp. 170–184.","ieee":"F. Yu, M. Rybar, C. Uhler, and S. Fienberg, “Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases,” in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Ibiza, Spain, 2014, vol. 8744, pp. 170–184.","apa":"Yu, F., Rybar, M., Uhler, C., & Fienberg, S. (2014). Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. In J. Domingo Ferrer (Ed.), Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8744, pp. 170–184). Ibiza, Spain: Springer. https://doi.org/10.1007/978-3-319-11257-2_14","ama":"Yu F, Rybar M, Uhler C, Fienberg S. Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases. In: Domingo Ferrer J, ed. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol 8744. Springer; 2014:170-184. doi:10.1007/978-3-319-11257-2_14","mla":"Yu, Fei, et al. “Differentially-Private Logistic Regression for Detecting Multiple-SNP Association in GWAS Databases.” Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), edited by Josep Domingo Ferrer, vol. 8744, Springer, 2014, pp. 170–84, doi:10.1007/978-3-319-11257-2_14."},"editor":[{"first_name":"Josep","full_name":"Domingo Ferrer, Josep","last_name":"Domingo Ferrer"}],"title":"Differentially-private logistic regression for detecting multiple-SNP association in GWAS databases","publist_id":"5004","author":[{"last_name":"Yu","full_name":"Yu, Fei","first_name":"Fei"},{"last_name":"Rybar","full_name":"Rybar, Michal","first_name":"Michal","id":"2B3E3DE8-F248-11E8-B48F-1D18A9856A87"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Uhler","orcid":"0000-0002-7008-0216","full_name":"Uhler, Caroline"},{"first_name":"Stephen","last_name":"Fienberg","full_name":"Fienberg, Stephen"}],"external_id":{"arxiv":["1407.8067"]},"project":[{"_id":"25636330-B435-11E9-9278-68D0E5697425","grant_number":"11-NSF-1070","name":"ROOTS Genome-wide Analysis of Root Traits"}],"language":[{"iso":"eng"}],"publication_status":"published","volume":8744,"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"Following the publication of an attack on genome-wide association studies (GWAS) data proposed by Homer et al., considerable attention has been given to developing methods for releasing GWAS data in a privacy-preserving way. Here, we develop an end-to-end differentially private method for solving regression problems with convex penalty functions and selecting the penalty parameters by cross-validation. In particular, we focus on penalized logistic regression with elastic-net regularization, a method widely used to in GWAS analyses to identify disease-causing genes. We show how a differentially private procedure for penalized logistic regression with elastic-net regularization can be applied to the analysis of GWAS data and evaluate our method’s performance."}],"month":"01","intvolume":" 8744","scopus_import":1,"alternative_title":["LNCS"],"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1407.8067"}],"date_updated":"2021-01-12T06:54:57Z","department":[{"_id":"KrPi"},{"_id":"CaUh"}],"_id":"2047","status":"public","type":"conference","conference":{"end_date":"2014-09-19","location":"Ibiza, Spain","start_date":"2014-09-17","name":"PSD: Privacy in Statistical Databases"}},{"_id":"2178","status":"public","type":"journal_article","date_updated":"2021-01-12T06:55:48Z","department":[{"_id":"CaUh"}],"oa_version":"Submitted Version","abstract":[{"text":"We consider the three-state toric homogeneous Markov chain model (THMC) without loops and initial parameters. At time T, the size of the design matrix is 6 × 3 · 2T-1 and the convex hull of its columns is the model polytope. We study the behavior of this polytope for T ≥ 3 and we show that it is defined by 24 facets for all T ≥ 5. Moreover, we give a complete description of these facets. From this, we deduce that the toric ideal associated with the design matrix is generated by binomials of degree at most 6. Our proof is based on a result due to Sturmfels, who gave a bound on the degree of the generators of a toric ideal, provided the normality of the corresponding toric variety. In our setting, we established the normality of the toric variety associated to the THMC model by studying the geometric properties of the model polytope.","lang":"eng"}],"intvolume":" 55","month":"03","main_file_link":[{"url":"http://arxiv.org/abs/1204.3070","open_access":"1"}],"scopus_import":1,"language":[{"iso":"eng"}],"publication_status":"published","volume":55,"issue":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Haws, David, Abraham Martin del Campo Sanchez, Akimichi Takemura, and Ruriko Yoshida. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” Beitrage Zur Algebra Und Geometrie. Springer, 2014. https://doi.org/10.1007/s13366-013-0178-y.","ista":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. 2014. Markov degree of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra und Geometrie. 55(1), 161–188.","mla":"Haws, David, et al. “Markov Degree of the Three-State Toric Homogeneous Markov Chain Model.” Beitrage Zur Algebra Und Geometrie, vol. 55, no. 1, Springer, 2014, pp. 161–88, doi:10.1007/s13366-013-0178-y.","short":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, R. Yoshida, Beitrage Zur Algebra Und Geometrie 55 (2014) 161–188.","ieee":"D. Haws, A. Martin del Campo Sanchez, A. Takemura, and R. Yoshida, “Markov degree of the three-state toric homogeneous Markov chain model,” Beitrage zur Algebra und Geometrie, vol. 55, no. 1. Springer, pp. 161–188, 2014.","ama":"Haws D, Martin del Campo Sanchez A, Takemura A, Yoshida R. Markov degree of the three-state toric homogeneous Markov chain model. Beitrage zur Algebra und Geometrie. 2014;55(1):161-188. doi:10.1007/s13366-013-0178-y","apa":"Haws, D., Martin del Campo Sanchez, A., Takemura, A., & Yoshida, R. (2014). Markov degree of the three-state toric homogeneous Markov chain model. Beitrage Zur Algebra Und Geometrie. Springer. https://doi.org/10.1007/s13366-013-0178-y"},"title":"Markov degree of the three-state toric homogeneous Markov chain model","author":[{"first_name":"David","full_name":"Haws, David","last_name":"Haws"},{"last_name":"Martin Del Campo Sanchez","full_name":"Martin Del Campo Sanchez, Abraham","id":"4CF47F6A-F248-11E8-B48F-1D18A9856A87","first_name":"Abraham"},{"first_name":"Akimichi","last_name":"Takemura","full_name":"Takemura, Akimichi"},{"full_name":"Yoshida, Ruriko","last_name":"Yoshida","first_name":"Ruriko"}],"publist_id":"4804","acknowledgement":"Research of Martín del Campo supported in part by NSF Grant DMS-915211.","oa":1,"quality_controlled":"1","publisher":"Springer","publication":"Beitrage zur Algebra und Geometrie","day":"01","year":"2014","date_created":"2018-12-11T11:56:10Z","date_published":"2014-03-01T00:00:00Z","doi":"10.1007/s13366-013-0178-y","page":"161 - 188"},{"type":"preprint","status":"public","_id":"2012","article_number":"1401.0468","author":[{"first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","last_name":"Iglesias Ham","full_name":"Iglesias Ham, Mabel"},{"orcid":"0000-0002-8030-9299","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael"},{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Uhler","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216"}],"publist_id":"5064","external_id":{"arxiv":["1401.0468"]},"article_processing_charge":"No","department":[{"_id":"HeEd"},{"_id":"CaUh"}],"title":"Sphere packing with limited overlap","date_updated":"2023-10-18T08:06:45Z","citation":{"chicago":"Iglesias Ham, Mabel, Michael Kerber, and Caroline Uhler. “Sphere Packing with Limited Overlap.” ArXiv, n.d. https://doi.org/10.48550/arXiv.1401.0468.","ista":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv, 1401.0468.","mla":"Iglesias Ham, Mabel, et al. “Sphere Packing with Limited Overlap.” ArXiv, 1401.0468, doi:10.48550/arXiv.1401.0468.","ama":"Iglesias Ham M, Kerber M, Uhler C. Sphere packing with limited overlap. arXiv. doi:10.48550/arXiv.1401.0468","apa":"Iglesias Ham, M., Kerber, M., & Uhler, C. (n.d.). Sphere packing with limited overlap. arXiv. https://doi.org/10.48550/arXiv.1401.0468","ieee":"M. Iglesias Ham, M. Kerber, and C. Uhler, “Sphere packing with limited overlap,” arXiv. .","short":"M. Iglesias Ham, M. Kerber, C. Uhler, ArXiv (n.d.)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"http://cccg.ca/proceedings/2014/papers/paper23.pdf"}],"oa":1,"month":"01","abstract":[{"text":"The classical sphere packing problem asks for the best (infinite) arrangement of non-overlapping unit balls which cover as much space as possible. We define a generalized version of the problem, where we allow each ball a limited amount of overlap with other balls. We study two natural choices of overlap measures and obtain the optimal lattice packings in a parameterized family of lattices which contains the FCC, BCC, and integer lattice.","lang":"eng"}],"oa_version":"Submitted Version","acknowledgement":"We thank Herbert Edelsbrunner for his valuable discussions and ideas on the topic of this paper. The second author has been supported by the Max Planck Center for Visual Computing and Communication","doi":"10.48550/arXiv.1401.0468","date_published":"2014-01-01T00:00:00Z","date_created":"2018-12-11T11:55:12Z","year":"2014","publication_status":"submitted","day":"01","language":[{"iso":"eng"}],"publication":"arXiv"}]