A Compression-Based Model of Musical Learning David Meredith DMRN+7, Queen Mary University of London, 18 December 2012.

Slides:



Advertisements
Similar presentations
Algorithms for pattern matching and pattern discovery in music David Meredith Aalborg University.
Advertisements

Lecture # 2 : Process Models
Music Processing Algorithms David Meredith Department of Media Technology Aalborg University.
Point-set algorithms for pattern discovery and pattern matching in music David Meredith Goldsmiths College University of London.
Pitch-spelling algorithms David Meredith Aalborg University.
Aural analysis for performing musicians The relationship between accents and expression Richard Parncutt Universität Graz VI. Kongress der Gesellschaft.
DATA MINING LECTURE 7 Minimum Description Length Principle Information Theory Co-Clustering.
Rhythmic Similarity Carmine Casciato MUMT 611 Thursday, March 13, 2005.
Computability and Complexity 20-1 Computability and Complexity Andrei Bulatov Random Sources.
Cognitive modelling (Cognitive Science MSc.) Fintan Costello
Supporting Design Managing complexity of designing Expressing ideas Testing ideas Quality assurance.
LEARNING FROM OBSERVATIONS Yılmaz KILIÇASLAN. Definition Learning takes place as the agent observes its interactions with the world and its own decision-making.
Fundamental limits in Information Theory Chapter 10 :
CSCI 3 Chapter 1.8 Data Compression. Chapter 1.8 Data Compression  For the purpose of storing or transferring data, it is often helpful to reduce the.
1 Abstract This study presents an analysis of two modified fuzzy ARTMAP neural networks. The modifications are first introduced mathematically. Then, the.
Code and Decoder Design of LDPC Codes for Gbps Systems Jeremy Thorpe Presented to: Microsoft Research
Models of Human Performance Dr. Chris Baber. 2 Objectives Introduce theory-based models for predicting human performance Introduce competence-based models.
IMS1805 Systems Analysis Topic 3: Doing analysis.
A Wavelet-Based Approach to the Discovery of Themes and Motives in Melodies Gissel Velarde and David Meredith Aalborg University Department of Architecture,
Vision in Man and Machine. STATS 19 SEM Talk 2. Alan L. Yuille. UCLA. Dept. Statistics and Psychology.
Mother and Child Health: Research Methods G.J.Ebrahim Editor Journal of Tropical Pediatrics, Oxford University Press.
Models of Generative Grammar Smriti Singh. Generative Grammar  A Generative Grammar is a set of formal rules that can generate an infinite set of sentences.
Statistical Natural Language Processing. What is NLP?  Natural Language Processing (NLP), or Computational Linguistics, is concerned with theoretical.
Modeling Language Acquisition with Neural Networks A preliminary research plan Steve R. Howell.
Grouping David Meredith Aalborg University. Musical grouping structure Listeners automatically chunk or “segment” music into structural units of various.
Introduction to algorithmic models of music cognition David Meredith Aalborg University.
Inferences about School Quality using opportunity to learn data: The effect of ignoring classrooms. Felipe Martinez CRESST/UCLA CCSSO Large Scale Assessment.
Metre David Meredith Aalborg University. Theories of musical metre A theory of musical metre should be able to predict – points in time when listeners.
INF oktober Analysis, interpretations and writing INF October 2005.
Huffman Encoding Veronica Morales.
Developing Search Skills in Music - Lipscomb University Music Library Developing Search Skills in Music: A Guide to Finding Materials in the Lipscomb University.
New Bulgarian University 9th International Summer School in Cognitive Science Simplicity as a Fundamental Cognitive Principle Nick Chater Institute for.
TAUCHI – Tampere Unit for Computer-Human Interaction 1 Statistical Models of Human Performance I. Scott MacKenzie.
Introduction Algorithms and Conventions The design and analysis of algorithms is the core subject matter of Computer Science. Given a problem, we want.
MUMT611: Music Information Acquisition, Preservation, and Retrieval Presentation on Timbre Similarity Alexandre Savard March 2006.
LEVEL 3 I can identify differences and similarities or changes in different scientific ideas. I can suggest solutions to problems and build models to.
Graphical Models in Vision. Alan L. Yuille. UCLA. Dept. Statistics.
A preliminary computational model of immanent accent salience in tonal music Richard Parncutt 1, Erica Bisesi 1, & Anders Friberg 2 1 University of Graz,
Coding Theory Efficient and Reliable Transfer of Information
Chapter 1 – Introducing Psychology Section 1 - Why Study Psychology Section 2 – A Brief History in Psychology Section 3 – Psychology as a Profession.
Concept learning, Regression Adapted from slides from Alpaydin’s book and slides by Professor Doina Precup, Mcgill University.
CS Inductive Bias1 Inductive Bias: How to generalize on novel data.
Data Mining Practical Machine Learning Tools and Techniques By I. H. Witten, E. Frank and M. A. Hall Chapter 5: Credibility: Evaluating What’s Been Learned.
Course: Structure-Aware Shape Processing Hao (Richard) Zhang Simon Fraser University (SFU), Canada Structural Hierarchies Course: Structure-Aware Shape.
RULES Patty Nordstrom Hien Nguyen. "Cognitive Skills are Realized by Production Rules"
Discuss how researchers analyze data obtained in observational research.
An evolutionary approach for improving the quality of automatic summaries Constantin Orasan Research Group in Computational Linguistics School of Humanities,
Slide 9.1 Saunders, Lewis and Thornhill, Research Methods for Business Students, 5 th Edition, © Mark Saunders, Philip Lewis and Adrian Thornhill 2009.
Discovering Musical Patterns through Perceptive Heuristics By Oliver Lartillot Presentation by Ananda Jacobs.
Bridging the gap between L2 speech perception research and phonological theory Paola Escudero & Paul Boersma (March 2002) Presented by Paola Escudero.
Explain How Researchers Use Inductive Content Analysis (Thematic Analysis) on Transcripts.
Midterm/Final Presentation Project Name Students: [Name1], [Name2] Supervisor: [SV Name] Context: Project [A/B/Special] Semester: Winter/Spring, Year Date:
Non-parametric Methods for Clustering Continuous and Categorical Data Steven X. Wang Dept. of Math. and Stat. York University May 13, 2010.
Learning to analyse tonal music Pl á cido Rom á n Illescas David Rizo Jos é Manuel I ñ esta Pattern recognition and Artificial Intelligence group University.
Week 2: Interviews. Definition and Types  What is an interview? Conversation with a purpose  Types of interviews 1. Unstructured 2. Structured 3. Focus.
Victorian Curriculum F–10 Online professional learning session Unpacking Digital Technologies Paula Christophersen Digital Technologies, Curriculum Manager.
Cognitive Modeling Cogs 4961, Cogs 6967 Psyc 4510 CSCI 4960 Mike Schoelles
Pareto-Optimality of Cognitively Preferred Polygonal Hulls for Dot Patterns Antony Galton University of Exeter UK.
Algorithmic Information Theory
Music Analysis and Kolmogorov Complexity
AF1: Thinking Scientifically
Geometric Pattern Discovery in Music
Writing for Academic Journals
Overview Part 1 – Design Procedure Beginning Hierarchical Design
Relational Algebra 461 The slides for this text are organized into chapters. This lecture covers relational algebra, from Chapter 4. The relational calculus.
Information-Theoretic Listening
Theory of Computation Turing Machines.
Integrating Segmentation and Similarity in Melodic Analysis
Information Theoretical Analysis of Digital Watermarking
David Meredith Aalborg University, Denmark
Presentation transcript:

A Compression-Based Model of Musical Learning David Meredith DMRN+7, Queen Mary University of London, 18 December 2012

The weather in Denmark

The goal of music analysis The goal of music analysis is to find the best possible explanations for musical works The “best possible” explanation for a musical work is one that allows you to – remember it most easily – identify errors most accurately – predict best what will come next –... The best possible explanation – is as simple as possible – accounts for as much detail as possible These two criteria often conflict Lerdahl and Jackendoff (1983, p.205)

A musical analysis as a program A musical analysis can be represented as a computer program or algorithm – The program must generate a representation of the music to be explained as its only output The program is usually a compact or compressed encoding of its output The program is a description of its output If this description is short enough, it becomes an explanation of its output Meredith (2012)

Program length as a measure of complexity From Kolmogorov (1965) complexity theory: – can use the length of a program to measure the complexity of its corresponding explanation – The shorter the program, the simpler and better the explanation P(p(0,0),p(0,1),p(1,0),p(1,1),p(2,0),p(2,1),p(2,2),p(2,3),p(3,0),p(3,1),p(3,2),p(3,3)) t(P(p(0,0),p(0,1),p(1,0),p(1,1)),V(v(2,0),v(2,2)))

Music analysis aims to compress music Since the best explanations are the shortest descriptions, the aim of music analysis is to compress music as much as possible P(p(1,27),p(2,26),p(3,27),p(4,28),p(5,26),p(6,25),p(7,26), p(8,27),p(9,25),p(10,24),p(11,25),p(12,26)) t(P(p(1,27),p(2,26),p(3,27), p(4,28)),V(v(4,-1),v(8,-2))) Meredith, Lemström and Wiggins (2002)

Perceptual organisations of surfaces Music analysis aims to find the most satisfying perceptual organisations that are consistent with a musical surface – could be a score or a performance Analysis of Chopin Op.10, No.5 Schenker (1925, p.92) Analysis of first bar of Chopin Op.10, No.5 Meredith (2012)

Likelihood vs. Simplicity Theories of perceptual organisation mostly based on either – Likelihood principle: Prefer the most probable interpretation (Helmholtz, 1910) – Simplicity principle: Prefer the simplest interpretation (Koffka, 1935) Chater (1996) showed that the two principles are mathematically identical Chater (1996, p.571) Likelihood Simplicity

Musical objects are interpreted in the context of larger containing objects A musical object (phrase, section, movement, work, corpus,...) is usually interpreted within the context of some larger object that contains it – e.g., a work is often interpreted in the context of its composer’s other works, or other works in the same genre or form or other works for the same instrument(s) P SW F C T M I

Analysts look for short programs that compute collections of musical objects The analyst tries to find the shortest program that computes a set of in extenso descriptions of – the object to be explained (the explanandum) – other objects, related to the explanandum, defining a context within which the explanandum is to be interpreted P P

Listener interprets new music in the context of previously heard music When the (expert) listener interprets a new piece, the existing explanation (program), P, for all music previously heard is modified (as little as possible), to produce a new program, P', to account for the new music in addition P P P'

Perceived structure represented by process by which object is generated Perceived structure of new musical object represented by specific way in which P' computes that object On this view, both music analysis and music perception are the compression of collections of musical objects P P P'

Perception and analysis are non- optimal compression Both analyst and (expert) listener aim to find shortest encodings Neither analyst nor listener achieve this aim in general Hampered by limitations of perceptual system e.g., require recognizable patterns to be fairly compact in pitch-time space (Collins et al., 2011)

Individual differences depend on order of presentation of context Prefer to re-use previous encodings wherever possible – “greedy algorithm”: means that way in which a new object is understood depends on the order of presentation of previous objects Implies that each individual will have a different interpretation of the same musical object that depends, not only on what previous music has been heard, but also the order in which it was encountered

Simple example using SIATECLearn

WTC I – Top-ranked patterns BWV 846a CoverLearn BWV 846b BWV 847a BWV 847b

WTC I - Top-ranked patterns BWV 848a CoverLearn BWV 848b BWV 849a BWV 849b

Summary Main claim is that both music analysis and music perception can be thought of as having the goal of compressing music A non-optimal, greedy compression strategy which maximises reuse of existing encodings provides an explanation for individual differences in interpretation A computational model based on the geometric, SIATEC pattern discovery algorithm has been adapted to implement a very simple version of this general idea and applied to Bach’s WTC I – Results are promising, but output needs to be studied in more depth to determine its significance

Links Slides can be downloaded from – SIATECCover source code – SIATECLearn source code –

References Chater, N. (1996). Reconciling simplicity and likelihood principles in perceptual organization. Psychological Review, 103(3): Collins, T., Laney, R., Willis, A. and Garthwaite, P. H. (2011). Modeling pattern importance in Chopin’s Mazurkas. Music Perception, 28(4): Koffka, K. (1935). Principles of Gestalt Psychology. Harcourt Brace, New York. Kolmogorov, A.N. (1965). Three approaches to the quantitative definition of information. Problems of Information Transmission, 1(1):1-7. Lerdahl, F. and Jackendoff, R. (1983). A Generative Theory of Tonal Music. MIT Press, Cambridge, MA. Meredith, D. (2012). A geometric language for representing structure in polyphonic music. Proceedings of the 13th International Society for Music Information Retrieval Conference, Porto, Portugal. Meredith, D., Lemström, K. and Wiggins. G. A. (2002). Algorithms for discovering repeated patterns in multidimensional representations of polyphonic music. Journal of New Music Research, 31(4): Schenker. H. (1925). Das Meisterwerk in der Musik (Vol. 1). Drei Masken Verlag, Munich. von Helmholtz. H. L. F. (1910/1962). Treatise on Physiological Optics. Dover, New York.