Tubingen : H. Laupp, 1889.

Paris : M. Huzard, 1820.

Londres : Paris, 1866.

Londres : Paris, 1840.

Paris : Béchet jeune, 1838.

An audit of the early-childhood education offerings in Minnesota finds complexity and fragmentation as well as a lack of data about program effectiveness.

A Paris (rue des deux portes, St André des arts no. 7) : chez Noel et c.ie, [1820?] ([Paris?] : Litho. de F. Noel)

London (46 Pall Mall) : Pub.d by R. Bowyer & M. Parkes, 1st Jan.y 1830.

[Manchester] : [James Mudd], [18--]

A Paris (rue du Cloître Notre Dame no. 4) : chez Tessari & Cie., [1829]

Berlin (Louisen-Str. 53) : Published by F. Silber, [between 1800 and 1899]

[Munich?], [between 1870 and 1879?]

München [Munich] : Fr. Hanfstaengl, [between 1870 and 1879?]

München [Munich] : Jos. Albert K.B. Hof-Photograph, [1860]

London (No. 32 Clipstone Street, Fitzroy Square) : Publish'd ... by S. Morgan, May 1st. 1802.

[London?] : [Illustrated London News?], [between 1850 and 1870?]

[19--?]

London (Braynes-Row, Spa-Fields) : Publish'd ... by R. Pollard printseller, Jany: 30th; 1797.

[between 1800 and 1899]

[Manchester] : [James Mudd], [between 1800 and 1899]

[Manchester] : [James Mudd], [between 1800 and 1899]

[London?]

[19--?]

[19--?]

[19--?]

[19--?]

[London] (No. 7 Weymouth Street, Portland Place) : Published as the Act directs ... by R. Duppa, Jan.y 1st 1802.

Amsterdam : Uitgegeven by Frans Buffa en Zonen, [between 1843 and 1845]

Amsterdam : Uitgegeven by Frans Buffa en Zonen, [between 1843 and 1845]

Republican legislators last month replaced the state's accountability system with a new one amid debate over the powers of the governor. The state education department says it's not ESSA-compliant.

London : Stacy Bias, 2019.

Rockville, Maryland : National Institute on Drug Abuse, 1987.

Rockville, Maryland : National Institute on Drug Abuse, 1995.

Rockville, Maryland : National Institute on Drug Abuse, 1984.

Rockville, Maryland : National Institute on Drug Abuse, 1979.

Rockville, Maryland : National Institute on Drug Abuse, 1980.

London : European Collaborating Centres in Addiction Studies, 1998.

Durham, N.C. : [publisher not identified], [1946-1965]

[New York, N.Y.] : [The Foundation] [195-?]-1970.

Durham, North Carolina : [Duke Station, 1957-[197-?]

Emanuel Ben-David, Bala Rajaratnam.

Source: Electronic Journal of Statistics, Volume 14, Number 1, 580--604.

Abstract:
The Wishart distribution defined on the open cone of positive-definite matrices plays a central role in multivariate analysis and multivariate distribution theory. Its domain of parameters is often referred to as the Gindikin set. In recent years, varieties of useful extensions of the Wishart distribution have been proposed in the literature for the purposes of studying Markov random fields and graphical models. In particular, generalizations of the Wishart distribution, referred to as Type I and Type II (graphical) Wishart distributions introduced by Letac and Massam in Annals of Statistics (2007) play important roles in both frequentist and Bayesian inference for Gaussian graphical models. These distributions have been especially useful in high-dimensional settings due to the flexibility offered by their multiple-shape parameters. Concerning Type I and Type II Wishart distributions, a conjecture of Letac and Massam concerns the domain of multiple-shape parameters of these distributions. The conjecture also has implications for the existence of Bayes estimators corresponding to these high dimensional priors. The conjecture, which was first posed in the Annals of Statistics, has now been an open problem for about 10 years. In this paper, we give a necessary condition for the Letac and Massam conjecture to hold. More precisely, we prove that if the Letac and Massam conjecture holds on a decomposable graph, then no two separators of the graph can be nested within each other. For this, we analyze Type I and Type II Wishart distributions on appropriate Markov equivalent perfect DAG models and succeed in deriving the aforementioned necessary condition. This condition in particular identifies a class of counterexamples to the conjecture.

Assaf Rabinowicz, Saharon Rosset.

Source: Electronic Journal of Statistics, Volume 14, Number 1, 272--301.

Abstract:
Common model selection criteria, such as $AIC$ and its variants, are based on in-sample prediction error estimators. However, in many applications involving predicting at interpolation and extrapolation points, in-sample error does not represent the relevant prediction error. In this paper new prediction error estimators, $tAI$ and $Loss(w_{t})$ are introduced. These estimators generalize previous error estimators, however are also applicable for assessing prediction error in cases involving interpolation and extrapolation. Based on these prediction error estimators, two model selection criteria with the same spirit as $AIC$ and Mallow’s $C_{p}$ are suggested. The advantages of our suggested methods are demonstrated in a simulation and a real data analysis of studies involving interpolation and extrapolation in linear mixed model and Gaussian process regression.

Graph learning from data is a canonical problem that has received substantial attention in the literature. Learning a structured graph is essential for interpretability and identification of the relationships among data. In general, learning a graph with a specific structure is an NP-hard combinatorial problem and thus designing a general tractable algorithm is challenging. Some useful structured graphs include connected, sparse, multi-component, bipartite, and regular graphs. In this paper, we introduce a unified framework for structured graph learning that combines Gaussian graphical model and spectral graph theory. We propose to convert combinatorial structural constraints into spectral constraints on graph matrices and develop an optimization framework based on block majorization-minimization to solve structured graph learning problem. The proposed algorithms are provably convergent and practically amenable for a number of graph based applications such as data clustering. Extensive numerical experiments with both synthetic and real data sets illustrate the effectiveness of the proposed algorithms. An open source R package containing the code for all the experiments is available at https://CRAN.R-project.org/package=spectralGraphTopology.

We study the identity testing problem in the context of spin systems or undirected graphical models, where it takes the following form: given the parameter specification of the model $M$ and a sampling oracle for the distribution $mu_{M^*}$ of an unknown model $M^*$, can we efficiently determine if the two models $M$ and $M^*$ are the same? We consider identity testing for both soft-constraint and hard-constraint systems. In particular, we prove hardness results in two prototypical cases, the Ising model and proper colorings, and explore whether identity testing is any easier than structure learning. For the ferromagnetic (attractive) Ising model, Daskalakis et al. (2018) presented a polynomial-time algorithm for identity testing. We prove hardness results in the antiferromagnetic (repulsive) setting in the same regime of parameters where structure learning is known to require a super-polynomial number of samples. Specifically, for $n$-vertex graphs of maximum degree $d$, we prove that if $|eta| d = omega(log{n})$ (where $eta$ is the inverse temperature parameter), then there is no polynomial running time identity testing algorithm unless $RP=NP$. In the hard-constraint setting, we present hardness results for identity testing for proper colorings. Our results are based on the presumed hardness of #BIS, the problem of (approximately) counting independent sets in bipartite graphs.