continuous representations what goes right and what goes
play

Continuous Representations: What goes right and what goes wrong? - PowerPoint PPT Presentation

Feb 27, 2023 •35 likes •325 views

Continuous Representations: What goes right and what goes wrong? Supplementary Slides Job Rock Department of Mathematics Brandeis University Joint with Kiyoshi Igusa and Gordana Todorov Representation Theory and Related Topics Seminar 3 May

  1. Continuous Representations: What goes right and what goes wrong? Supplementary Slides Job Rock Department of Mathematics Brandeis University Joint with Kiyoshi Igusa and Gordana Todorov Representation Theory and Related Topics Seminar 3 May 2019 Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 0 / 9

  2. Topics 1 Continuous Clusters 2 Continuous Mutation Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 0 / 9

  3. Topics 1 Continuous Clusters 2 Continuous Mutation Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 0 / 9

  4. Examples Example Let a < b ∈ R and T = { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { [ x , a ) , { x } : −∞ < x < a } ∪ { ( a , x ] , { x } : a < x < b } ∪ { ( b , x ] , { x } : b < x } . T is a continuous cluster with three continuous fountains . Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 1 / 9

  5. Examples Example Let a < b ∈ R and T = { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { [ x , a ) , { x } : −∞ < x < a } ∪ { ( a , x ] , { x } : a < x < b } ∪ { ( b , x ] , { x } : b < x } . T is a continuous cluster with three continuous fountains . We can visualize T as a set of noncrossing partitions of R : Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 1 / 9

  6. Structure The types of compatible sets that make up a continuous cluster are: • Discrete • Nests • Continuous fountains (a type of nest) • Antifountains (a type of nest) • Simples Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 2 / 9

  7. Structure The types of compatible sets that make up a continuous cluster are: • Discrete • Nests • Continuous fountains (a type of nest) • Antifountains (a type of nest) • Simples Example Discrete Antifountain Nest Continuous Fountain Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 2 / 9

  8. Structure Example Here is another picture of a continuous cluster. Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 3 / 9

  9. Structure Example Here is another picture of a continuous cluster. Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 3 / 9

  10. Topics 1 Continuous Clusters 2 Continuous Mutation Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 3 / 9

  11. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  12. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  13. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  14. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  15. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  16. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  17. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  18. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  19. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  20. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  21. Examples Example (Continuous Flip) Let a , b ∈ R such that a < 0 < b . Let T be { ( −∞ , + ∞ ) , ( −∞ , a ) , ( a , b ) , ( −∞ , b ) , ( b , + ∞ ) } ∪ { ( −∞ , x ] , { x } , ( a , y ] , { y } , ( b , z ] , { z }} for all x < a < y < b < z . We’re going to “flip” this blue continuous fountain at a to a purple continuous fountain at b . µ ( a , y ] �→ [ y , b ) and f ( a , y ] = b − y b − a = g [ y , b ) Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 4 / 9

  22. Examples Example (Lamination) Here is a picture: µ t = h ( x ) ( −∞ x ) { x } Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 5 / 9

  23. Examples Example (Transfinite Mutation) · · · · · · -3 -2 -1 0 1 2 3 Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 6 / 9

  24. Examples Example (Transfinite Mutation) · · · · · · -3 -2 -1 0 1 2 3 Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 6 / 9

  25. Examples Example (Transfinite Mutation) · · · · · · -3 -2 -1 0 1 2 3 Job Rock (w/ Igusa and Todorov) Continuous Representations at Northeastern 03.05.2019 6 / 9

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

INF@AVS 2018: Learning discrete and continuous representations for cross-modal retrieval

INF@AVS 2018: Learning discrete and continuous representations for cross-modal retrieval

INF@AVS 2018: Learning discrete and continuous representations for cross-modal retrieval Po-Yao(Bernie) Huang, Junwei Liang, Vaibhav, Xiaojun Chang and Alexander Hauptmann Carnegie Mellon University, Monash University Outline

327 views • 32 slides
Continuous Wavelet Transform: ECG Recognition Based on Phase and Modulus Representations E DGAR G

Continuous Wavelet Transform: ECG Recognition Based on Phase and Modulus Representations E DGAR G

I NTRODUCTION T HE S QUARE M ODULUS AND P HASE E XAMPLES C ONCLUSION R EFERENCES Continuous Wavelet Transform: ECG Recognition Based on Phase and Modulus Representations E DGAR G ONZALEZ Based on the paper by: Lofti Senhadjii, Laurent Thoroval,

750 views • 64 slides
CS354 Nathan Sprague October 25, 2020 Probabilistic State Representations: Continuous

CS354 Nathan Sprague October 25, 2020 Probabilistic State Representations: Continuous

CS354 Nathan Sprague October 25, 2020 Probabilistic State Representations: Continuous Probabilistic Robotics. Thrun, Burgard, Fox, 2005 Combining Evidence Imagine two independent measurements of some unknown quantity: x 1 with variance 2

415 views • 17 slides
Scene Represe sentation Networks: ks: Continuous 3D-Structure-Aware Neural Scene Representations

Scene Represe sentation Networks: ks: Continuous 3D-Structure-Aware Neural Scene Representations

Scene Represe sentation Networks: ks: Continuous 3D-Structure-Aware Neural Scene Representations Vincent Sitzmann Michael Zollhfer Gordon Wetzstein single image camera pose Novel Views Surface Normals intrinsics Self-supervised Scene

600 views • 48 slides
CS354 Nathan Sprague October 13, 2020 Probabilistic State Representations: Continuous

CS354 Nathan Sprague October 13, 2020 Probabilistic State Representations: Continuous

CS354 Nathan Sprague October 13, 2020 Probabilistic State Representations: Continuous Probabilistic Robotics. Thrun, Burgard, Fox, 2005 Probability Density Functions Represent probability distributions over random variables: Properties: f (

424 views • 21 slides
6.003: Signals and Systems Continuous-Time Systems September 20, 2011 1 Multiple Representations

6.003: Signals and Systems Continuous-Time Systems September 20, 2011 1 Multiple Representations

6.003: Signals and Systems Continuous-Time Systems September 20, 2011 1 Multiple Representations of Discrete-Time Systems DiscreteTime (DT) systems can be represented in different ways to more easily address different types of issues. Verbal

790 views • 50 slides
Mikolovs Language Models: Distributed Representations of Sentences and Documents Recurrent

Mikolovs Language Models: Distributed Representations of Sentences and Documents Recurrent

Motivation Introduction and Background Paragraph Embeddings Performance Linguistic Regularities in Continuous Space Word Representations Mikolovs Language Models: Distributed Representations of Sentences and Documents Recurrent Neural

356 views • 20 slides
From p -adic to Artin representations: a story in three vignettes Henri Darmon Montr eal,

From p -adic to Artin representations: a story in three vignettes Henri Darmon Montr eal,

SCHOLAR: Conference in honor of Ram Murtys 60th birthday From p -adic to Artin representations: a story in three vignettes Henri Darmon Montr eal, October 15, 2013 Artin representations Definition An Artin representation is a continuous

777 views • 31 slides
Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap

Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap

Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap Maxent models Basic neural language models Continuous representations Motivation Key idea: represent words with vectors Two common counting types

889 views • 60 slides
Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap

Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap

Distributed Representations CMSC 473/673 UMBC Some slides adapted from 3SLP Outline Recap Maxent models Basic neural language models Continuous representations Motivation Key idea: represent blobs with vectors Two common counting types

1.19k views • 87 slides
Modular Representations: McCoy et al. 2019 &amp; Andreas 2019 Rami Hope Ekin The Question To

Modular Representations: McCoy et al. 2019 &amp; Andreas 2019 Rami Hope Ekin The Question To

Modular Representations: McCoy et al. 2019 &amp; Andreas 2019 Rami Hope Ekin The Question To what extent do learned representations (continuous vectors) of symbolic structures (sentences, trees) exhibit compositional structure?

920 views • 54 slides
I N A NUTSHELL ... Efficent visualization tool : for small sample continuous datasets

I N A NUTSHELL ... Efficent visualization tool : for small sample continuous datasets

1 A G RAPHICAL T OOL FOR THE D ETECTION OF M ODES IN C ONTINUOUS D ATA Thomas Burger &amp; Thierry Dhorne (Lab-STICC) Thomas Burger 2 O UTLINES 1. Visual representations/mode estimation of small size continuous-valued datasets 2. Density

434 views • 19 slides
On SAT representations of XOR constraints (towards a theory of good SAT representations) Oliver

On SAT representations of XOR constraints (towards a theory of good SAT representations) Oliver

On SAT representations of XOR constraints (towards a theory of good SAT representations) Oliver Kullmann Computer Science Department Swansea University http://cs.swan.ac.uk/~csoliver/ Theoretical Foundations of Applied SAT Solving January 24,

722 views • 48 slides
THE C -ENVELOPE OF A SEMICROSSED PRODUCT AND NEST REPRESENTATIONS JUSTIN R. PETERS X a

THE C -ENVELOPE OF A SEMICROSSED PRODUCT AND NEST REPRESENTATIONS JUSTIN R. PETERS X a

THE C -ENVELOPE OF A SEMICROSSED PRODUCT AND NEST REPRESENTATIONS JUSTIN R. PETERS X a Abstract. Let X be compact Hausdorff, and : X continuous surjection. Let A be the semicrossed product algebra corresponding to the relation fU = Uf

540 views • 17 slides
On SAT representations of XOR constraints (towards a theory of good SAT representations) Matthew

On SAT representations of XOR constraints (towards a theory of good SAT representations) Matthew

On SAT representations of XOR constraints (towards a theory of good SAT representations) Matthew Gwynne Oliver Kullmann Computer Science Department Swansea University http://cs.swan.ac.uk/~csoliver/papers.html LATA 2014 March 14, 2014 M

608 views • 43 slides
Continuous Probability 3 2 Continuous Probability Motivation I Sometimes you cant model

Continuous Probability 3 2 Continuous Probability Motivation I Sometimes you cant model

Continuous Probability 3 2 Continuous Probability Motivation I Sometimes you cant model things discretely. Random real numbers. Points on a map. Time. Probability space is continuous . What is an event in continuous probability?

75 views • 7 slides
Hopf orders in Hopf algebras with trivial Verschiebung Alan Koch Agnes Scott College June, 2015

Hopf orders in Hopf algebras with trivial Verschiebung Alan Koch Agnes Scott College June, 2015

Hopf orders in Hopf algebras with trivial Verschiebung Alan Koch Agnes Scott College June, 2015 Alan Koch (Agnes Scott College) 1 / 47 Overview, Assumptions Let R be a complete discrete valuation ring of (equal) characteristic p , K = Frac R

677 views • 48 slides
Big picture All languages Decidable Turing machines NP P Context-free

Big picture All languages Decidable Turing machines NP P Context-free

Big picture All languages Decidable Turing machines NP P Context-free Context-free grammars, push-down automata Regular Automata, non-deterministic automata, regular expressions Recall: Theorem: L := {0 n 1 n : n 0}

1.23k views • 108 slides
Flexibly Fair Representation Learning by Disentanglement Elliot Creager 1 2 David Madras 1 2 J

Flexibly Fair Representation Learning by Disentanglement Elliot Creager 1 2 David Madras 1 2 J

Flexibly Fair Representation Learning by Disentanglement Elliot Creager 1 2 David Madras 1 2 J orn-Henrik Jacobsen 2 Marissa A. Weis 2 3 Kevin Swersky 4 Toniann Pitassi 1 2 Richard Zemel 1 2 June 13, 2019 1 University of Toronto 2 Vector

533 views • 8 slides
Change of Basis Marco Chiarandini Department of Mathematics &amp; Computer Science University of

Change of Basis Marco Chiarandini Department of Mathematics &amp; Computer Science University of

DM559 Linear and Integer Programming Lecture 8 Change of Basis Marco Chiarandini Department of Mathematics &amp; Computer Science University of Southern Denmark Coordinate Change Outline 1. Coordinate Change 2 Coordinate Change Resume

504 views • 14 slides
On some open questions related to transport equations with critical regularity F. Bouchut 1 1

On some open questions related to transport equations with critical regularity F. Bouchut 1 1

On some open questions related to transport equations with critical regularity F. Bouchut 1 1 LAMA, CNRS &amp; Universit e Paris-Est-Marne-la-Vall ee Basel, June 2017 Transport equations with critical regularity 1 Outline 1 A review of

757 views • 31 slides
Limits on the Hardness of Lattice Problems in p Norms Chris Peikert SRI International

Limits on the Hardness of Lattice Problems in p Norms Chris Peikert SRI International

Limits on the Hardness of Lattice Problems in p Norms Chris Peikert SRI International Complexity 2007 1 / 12 Lattices and Their Problems Let B = { b 1 , . . . , b n } R n be linearly independent. The n -dim lattice L having basis B is:

902 views • 58 slides
Algorithms (2IL15) Lecture 10 NP-Completeness, II 1 TU/e Algorithms (2IL15) Lecture 10

Algorithms (2IL15) Lecture 10 NP-Completeness, II 1 TU/e Algorithms (2IL15) Lecture 10

TU/e Algorithms (2IL15) Lecture 10 Algorithms (2IL15) Lecture 10 NP-Completeness, II 1 TU/e Algorithms (2IL15) Lecture 10 Summary of previous lecture P: class of decision problems that can be solved in polynomial time NP:

496 views • 34 slides
Cubical Type Theory favonia 1 2 t f 2 t f 2 t f 2

Cubical Type Theory favonia 1 2 t f 2 t f 2 t f 2

Cubical Type Theory favonia 1 2 t f 2 t f 2 t f 2 t f 4 0 7 3 8 1 5 2 6 2 t f 4 0 7 3 8 1 5 2 6 2 3 3 3 3

1.05k views • 62 slides

More recommend