Davoud Ataee Tarzanagh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Davoud Ataee Tarzanagh has a total of 6 co-authors. Here are the top co-authors by number of shared publications:
- Mohammad Reza Peyghami
K.N. Toosi University of Technology
4 shared publications - Alfred Olivier Hero
University of Michigan
1 shared publication - Fabian Bastin
Université de Montréal
1 shared publication - Hamid Mesgarani
Faculty of Science, Department of Mathematics, Shahid Rajaee Teacher Training University 1 , Tehran 16785-136
1 shared publication - Laura Balzano
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA
1 shared publication - Z. Saeidian
Department of Mathematics, K.N. Toosi University of Technology, Tehran, Iran
1 shared publication
Latest Publications
- Open Access
Fair Community Detection and Structure Learning in Heterogeneous Graphical Models
Inference of community structure in probabilistic graphical models may not be consistent with fairness constraints when nodes have demographic attributes. Certain demographics may be over-represented in some detected communities and under-represented in others. This paper defines a novel $\ell_1$-regularized pseudo-likelihood approach for fair graphical model selection. In particular, we assume there is some community or clustering structure in the true underlying graph, and we seek to learn a sparse undirected graph and its communities from the data such that demographic groups are fairly represented within the communities. In the case when the graph is known a priori, we provide a convex semidefinite programming approach for fair community detection. We establish the statistical consistency of the proposed method for both a Gaussian graphical model and an Ising model for, respectively, continuous and binary data, proving that our method can recover the graphs and their fair communities with high probability.
Open AccessFair Community Detection and Structure Learning in Heterogeneous Graphical Models
Inference of community structure in probabilistic graphical models may not be consistent with fairness constraints when nodes have demographic attributes. Certain demographics may be over-represented in some detected communities and under-represented in others. This paper defines a novel $\ell_1$-regularized pseudo-likelihood approach for fair graphical model selection. In particular, we assume there is some community or clustering structure in the true underlying graph, and we seek to learn a sparse undirected graph and its communities from the data such that demographic groups are fairly represented within the communities. In the case when the graph is known a priori, we provide a convex semidefinite programming approach for fair community detection. We establish the statistical consistency of the proposed method for both a Gaussian graphical model and an Ising model for, respectively, continuous and binary data, proving that our method can recover the graphs and their fair communities with high probability.
- 5 August 2015
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 167 (2) , 676-692
A New Nonmonotone Adaptive Retrospective Trust Region Method for Unconstrained Optimization Problems
- 5 August 2015
- Published by Springer Nature in Journal of Optimization Theory and Applications
- Vol. 167 (2) , 676-692
A New Nonmonotone Adaptive Retrospective Trust Region Method for Unconstrained Optimization Problems
- 27 May 2015
- Published by Springer Nature in Journal of Global Optimization
- Vol. 63 (4) , 709-728
A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- 27 May 2015
- Published by Springer Nature in Journal of Global Optimization
- Vol. 63 (4) , 709-728
A new regularized limited memory BFGS-type method based on modified secant conditions for unconstrained optimization problems
- 30 January 2015
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 61 (2) , 321-341
A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
- 30 January 2015
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 61 (2) , 321-341
A relaxed nonmonotone adaptive trust region method for solving unconstrained optimization problems
- 17 December 2013
- Published by Springer Nature in Optimization Letters
- Vol. 9 (2) , 283-310
A new trust region method for solving least-square transformation of system of equalities and inequalities
- 17 December 2013
- Published by Springer Nature in Optimization Letters
- Vol. 9 (2) , 283-310
A new trust region method for solving least-square transformation of system of equalities and inequalities