Deposits of clastic carbonate-dominated (calciclastic) sedimentary slope systems in the rock record have been identified mostly as linearly-consistent carbonate apron deposits, even though most ancient clastic carbonate slope deposits fit the submarine fan systems better. Calciclastic submarine fans are consequently rarely described and are poorly understood. Subsequently, very little is known especially in mud-dominated calciclastic submarine fan systems. Presented in this study are a sedimentological core and petrographic characterisation of samples from eleven boreholes from the Lower Carboniferous of Bowland Basin (Northwest England) that reveals a >250 m thick calciturbidite complex deposited in a calciclastic submarine fan setting. Seven facies are recognised from core and thin section characterisation and are grouped into three carbonate turbidite sequences. They include: 1) Calciturbidites, comprising mostly of highto low-density, wavy-laminated bioclast-rich facies; 2) low-density densite mudstones which are characterised by planar laminated and unlaminated muddominated facies; and 3) Calcidebrites which are muddy or hyper-concentrated debrisflow deposits occurring as poorly-sorted, chaotic, mud-supported floatstones. These

Phd by thesis

Today's Web-enabled deluge of electronic data calls for automated methods of data analysis. Machine learning provides these, developing methods that can automatically detect patterns in data and then use the uncovered patterns to predict future data. This textbook offers a comprehensive and self-contained introduction to the field of machine learning, based on a unified, probabilistic approach. The coverage combines breadth and depth, offering necessary background material on such topics as probability, optimization, and linear algebra as well as discussion of recent developments in the field, including conditional random fields, L1 regularization, and deep learning. The book is written in an informal, accessible style, complete with pseudo-code for the most important algorithms. All topics are copiously illustrated with color images and worked examples drawn from such application domains as biology, text processing, computer vision, and robotics. Rather than providing a cookbook of different heuristic methods, the book stresses a principled model-based approach, often using the language of graphical models to specify models in a concise and intuitive way. Almost all the models described have been implemented in a MATLAB software package--PMTK (probabilistic modeling toolkit)--that is freely available online. The book is suitable for upper-level undergraduates with an introductory-level college math background and beginning graduate students.

Machine Learning : A Probabilistic Perspective

/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

Convergence of Probability Measures. By P. Billingsley. Chichester, Sussex, Wiley, 1968. xii, 253 p. 9 1/4“. 117s.

Convergence of Probability Measures

The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs. Neighborhood selection estimates the conditional independence restrictions separately for each node in the graph and is hence equivalent to variable selection for Gaussian linear models. We show that the proposed neighborhood selection scheme is consistent for sparse high-dimensional graphs. Consistency hinges on the choice of the penalty parameter. The oracle value for optimal prediction does not lead to a consistent neighborhood estimate. Controlling instead the probability of falsely joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.

/pdf/high-dimensional-graphs-and-variable-selection-with-the-43n0acy929.pdf

High-dimensional graphs and variable selection with the Lasso

1.1. Introduction.- 1.2. Outer Integrals and Measurable Majorants.- 1.3. Weak Convergence.- 1.4. Product Spaces.- 1.5. Spaces of Bounded Functions.- 1.6. Spaces of Locally Bounded Functions.- 1.7. The Ball Sigma-Field and Measurability of Suprema.- 1.8. Hilbert Spaces.- 1.9. Convergence: Almost Surely and in Probability.- 1.10. Convergence: Weak, Almost Uniform, and in Probability.- 1.11. Refinements.- 1.12. Uniformity and Metrization.- 2.1. Introduction.- 2.2. Maximal Inequalities and Covering Numbers.- 2.3. Symmetrization and Measurability.- 2.4. Glivenko-Cantelli Theorems.- 2.5. Donsker Theorems.- 2.6. Uniform Entropy Numbers.- 2.7. Bracketing Numbers.- 2.8. Uniformity in the Underlying Distribution.- 2.9. Multiplier Central Limit Theorems.- 2.10. Permanence of the Donsker Property.- 2.11. The Central Limit Theorem for Processes.- 2.12. Partial-Sum Processes.- 2.13. Other Donsker Classes.- 2.14. Tail Bounds.- 3.1. Introduction.- 3.2. M-Estimators.- 3.3. Z-Estimators.- 3.4. Rates of Convergence.- 3.5. Random Sample Size, Poissonization and Kac Processes.- 3.6. The Bootstrap.- 3.7. The Two-Sample Problem.- 3.8. Independence Empirical Processes.- 3.9. The Delta-Method.- 3.10. Contiguity.- 3.11. Convolution and Minimax Theorems.- A. Appendix.- A.1. Inequalities.- A.2. Gaussian Processes.- A.2.1. Inequalities and Gaussian Comparison.- A.2.2. Exponential Bounds.- A.2.3. Majorizing Measures.- A.2.4. Further Results.- A.3. Rademacher Processes.- A.4. Isoperimetric Inequalities for Product Measures.- A.5. Some Limit Theorems.- A.6. More Inequalities.- A.6.1. Binomial Random Variables.- A.6.2. Multinomial Random Vectors.- A.6.3. Rademacher Sums.- Notes.- References.- Author Index.- List of Symbols.

Weak Convergence and Empirical Processes: With Applications to Statistics

/pdf/weak-convergence-and-empirical-processes-26hoignksd.pdf

Weak Convergence and Empirical Processes

Here is the first book to summarize a broad cross-section of the large volume of literature available on one-dimensional empirical processes. Presented is a thorough treatment of the theory of empirical processes, with emphasis on real random variable processes as well as a wide-ranging selection of applications in statistics. Featuring many tables and illustrations accompanying the proofs of major results, coverage includes foundations - special spaces and special processes, convergence and distribution of empirical processes, alternatives and processes of residuals, integral tests of fit and estimated empirical processes and martingale methods.

Empirical processes with applications to statistics

Efficient and Adaptive Estimation for Semiparametric Models.

I. Information Bounds.- 1 Models, scores, and tangent spaces.- 1.1 Introduction.- 1.2 Models P.- 1.3 Scores: Differentiability of the Model.- 1.4 Tangent Sets P0 and Tangent Spaces P.- 1.5 Score Operators.- 1.6 Exercises.- 2 Convolution and asymptotic minimax theorems.- 2.1 Introduction.- 2.2 Finite-dimensional Parameter Spaces.- 2.3 Infinite-dimensional Parameter Spaces.- 2.4 Exercises.- 3 Van der Vaart's Differentiability Theorem.- 3.1 Differentiability of Implicitly Defined Functions.- 3.2 Some Applications of the Differentiability Theorem.- 3.3 Exercises.- II. Nonparametric Maximum Likelihood Estimation.- 1 The interval censoring problem.- 1.1 Characterization of the non-parametric maximum likelihood estimators.- 1.2Exercises.- 2 The deconvolution problem.- 2.1 Decreasing densities and non-negative random variables.- 2.2 Convolution with symmetric densities.- 2.3 Exercises.- 3 Algorithms.- 3.1 The EM algorithm.- 3.2 The iterative convex minorant algorithm.- 3.3 Exercises.- 4 Consistency.- 4.1 Interval censoring, Case 1.- 4.2 Convolution with a symmetric density.- 4.3 Interval censoring, Case 2.- 4.4 Exercises.- 5 Distribution theory.- 5.1 Interval censoring, Case 1.- 5.2 Interval censoring, Case 2.- 5.3 Deconvolution with a decreasing density.- 5.4 Estimation of the mean.- 5.5 Exercises.- References.

Jon A. Wellner

Papers

Weak Convergence and Empirical Processes: With Applications to Statistics

Weak Convergence and Empirical Processes

Empirical processes with applications to statistics

Efficient and Adaptive Estimation for Semiparametric Models.

Information Bounds and Nonparametric Maximum Likelihood Estimation