convex codes and minimal embedding dimensions
play

Convex Codes and Minimal Embedding Dimensions Megan Franke UC Santa - PowerPoint PPT Presentation

Jul 22, 2023 •438 likes •884 views

Convex Codes and Minimal Embedding Dimensions Megan Franke UC Santa Barbara July 17, 2017 Franke (UCSB) Just Convex Realization July 17, 2017 1 / 21 Neural Codes 2014 Nobel Prize in Physiology or Medicine: Place Cells Franke (UCSB) Just

  1. Convex Codes and Minimal Embedding Dimensions Megan Franke UC Santa Barbara July 17, 2017 Franke (UCSB) Just Convex Realization July 17, 2017 1 / 21

  2. Neural Codes 2014 Nobel Prize in Physiology or Medicine: Place Cells Franke (UCSB) Just Convex Realization July 17, 2017 2 / 21

  3. Neural Codes 2014 Nobel Prize in Physiology or Medicine: Place Cells Each place cell corresponds to a receptive field Franke (UCSB) Just Convex Realization July 17, 2017 2 / 21

  4. Neural Codes 2014 Nobel Prize in Physiology or Medicine: Place Cells Each place cell corresponds to a receptive field The receptive fields from a set of neurons give us a neural code Figure: Place Cells Franke (UCSB) Just Convex Realization July 17, 2017 2 / 21

  5. Neural Code Example Convex Code: {∅ , 1 , 2 , 12 } U 1 U 2 Franke (UCSB) Just Convex Realization July 17, 2017 3 / 21

  6. Convex Neural Codes Definition We say that a code C is a convex code on n neurons if there exists a collection of sets U = { U 1 , U 2 , . . . , U n } such that for each i ∈ [ n ], U i is a convex subset of R d and C ( U ) = C . A code C = C ( U ) is open convex or closed convex if the U i ∈ U are all open or all closed. Franke (UCSB) Just Convex Realization July 17, 2017 4 / 21

  7. When are codes just convex? Goal Classify which codes are convex open, convex closed, just convex, or not convex at all. Franke (UCSB) Just Convex Realization July 17, 2017 5 / 21

  8. When are codes just convex? Goal Classify which codes are convex open, convex closed, just convex, or not convex at all. Theorem (F., Muthiah) Every neural code is just convex. Franke (UCSB) Just Convex Realization July 17, 2017 5 / 21

  9. Definitions Definition Let X 1 , X 2 , . . . , X n be subsets of R d . Define the convex hull of X 1 , X 2 , . . . , X n to be the smallest convex set in R d containing X 1 , X 2 , . . . , X n , denoted by conv( X 1 , X 2 , . . . , X n ). Franke (UCSB) Just Convex Realization July 17, 2017 6 / 21

  10. Definitions Definition Let X 1 , X 2 , . . . , X n be subsets of R d . Define the convex hull of X 1 , X 2 , . . . , X n to be the smallest convex set in R d containing X 1 , X 2 , . . . , X n , denoted by conv( X 1 , X 2 , . . . , X n ). Let X 1 = (0 , 0 , 0), X 2 = (1 , 0 , 0), X 3 = (0 , 1 , 0), and X 4 = (0 , 0 , 1). Franke (UCSB) Just Convex Realization July 17, 2017 6 / 21

  11. Definitions Definition Let X 1 , X 2 , . . . , X n be subsets of R d . Define the convex hull of X 1 , X 2 , . . . , X n to be the smallest convex set in R d containing X 1 , X 2 , . . . , X n , denoted by conv( X 1 , X 2 , . . . , X n ). Let X 1 = (0 , 0 , 0), X 2 = (1 , 0 , 0), X 3 = (0 , 1 , 0), and X 4 = (0 , 0 , 1). Then the convex hull of { X 1 , X 2 , X 3 , X 4 } is X 3 X 1 X 2 X 4 Franke (UCSB) Just Convex Realization July 17, 2017 6 / 21

  12. Just Convex Construction Let C be a code on n neurons where C \ {∅} = { σ 1 , σ 2 , . . . , σ k } and let { e 1 , ..., e k − 1 } be the standard basis for R k − 1 . Franke (UCSB) Just Convex Realization July 17, 2017 7 / 21

  13. Just Convex Construction Let C be a code on n neurons where C \ {∅} = { σ 1 , σ 2 , . . . , σ k } and let { e 1 , ..., e k − 1 } be the standard basis for R k − 1 . Take σ 1 . Then for every j ∈ [ n ], if j ∈ σ 1 define V 1 j to be the closed point at the origin. V 1 j Otherwise, define V 1 j = ∅ . Franke (UCSB) Just Convex Realization July 17, 2017 7 / 21

  14. Just Convex Construction Take σ 2 . Then for every j ∈ [ n ], if j ∈ σ 2 define V 2 j to be conv { 0 , e 1 } − { 0 } . V 2 j e 1 Otherwise, define V 2 j = ∅ . Franke (UCSB) Just Convex Realization July 17, 2017 8 / 21

  15. Just Convex Construction Next take σ 3 . Then for every j ∈ [ n ], if j ∈ σ 3 define V 3 j to be conv { 0 , e 1 , e 2 } , but open along its intersection with conv { 0 , e 1 } . e 2 V 3 j e 1 Otherwise, define V 3 j = ∅ . Franke (UCSB) Just Convex Realization July 17, 2017 9 / 21

  16. Just Convex Construction Continuing in this way, for all j ∈ [ n ], if j ∈ σ m , define V m to be j conv { 0 , e 1 , e 2 , . . . , e m − 1 } , but open along its intersection with conv { 0 , e 1 , e 2 , . . . , e m − 2 } . Otherwise, define V m = ∅ . j Franke (UCSB) Just Convex Realization July 17, 2017 10 / 21

  17. Just Convex Construction When this has been completed for all σ j ∈ C , define � j = V 1 j ∪ V 2 V i j ∪ . . . ∪ V k U j = j i ∈ [ k ] for all j ∈ [ n ]. Franke (UCSB) Just Convex Realization July 17, 2017 11 / 21

  18. Example Let C = {∅ , 12 , 13 , 23 } . Franke (UCSB) Just Convex Realization July 17, 2017 12 / 21

  19. Example Let C = {∅ , 12 , 13 , 23 } . Then σ 1 = 12, σ 2 = 13, σ 3 = 23. Franke (UCSB) Just Convex Realization July 17, 2017 12 / 21

  20. Example Let C = {∅ , 12 , 13 , 23 } . Then σ 1 = 12, σ 2 = 13, σ 3 = 23. V codeword# neuron Franke (UCSB) Just Convex Realization July 17, 2017 12 / 21

  21. Example Let C = {∅ , 12 , 13 , 23 } . Then σ 1 = 12, σ 2 = 13, σ 3 = 23. V codeword# neuron V 1 3 = ∅ V 1 V 1 1 2 Franke (UCSB) Just Convex Realization July 17, 2017 12 / 21

  22. Example Let C = {∅ , 12 , 13 , 23 } . Then σ 1 = 12, σ 2 = 13, σ 3 = 23. V codeword# neuron V 1 3 = ∅ V 1 V 1 1 2 V 2 V 2 V 2 2 = ∅ 1 3 Franke (UCSB) Just Convex Realization July 17, 2017 12 / 21

  23. Example Let C = {∅ , 12 , 13 , 23 } . Then σ 1 = 12, σ 2 = 13, σ 3 = 23. V codeword# neuron V 1 3 = ∅ V 1 V 1 1 2 V 2 V 2 V 2 2 = ∅ 1 3 V 3 1 = ∅ V 3 V 3 2 3 Franke (UCSB) Just Convex Realization July 17, 2017 12 / 21

  24. Example C = {∅ , 12 , 13 , 23 } U 1 U 2 U 3 Franke (UCSB) Just Convex Realization July 17, 2017 13 / 21

  25. Minimal Embedding Dimension {∅ , 1, 2, 3, 4, 5, 12, 15, 23, 24, 25, 34, 45, 56, 125, 234, 245 } Franke (UCSB) Just Convex Realization July 17, 2017 14 / 21

  26. Minimal Embedding Dimension {∅ , 1, 2, 3, 4, 5, 12, 15, 23, 24, 25, 34, 45, 56, 125, 234, 245 } Franke (UCSB) Just Convex Realization July 17, 2017 14 / 21

  27. Minimal Embedding Dimension Definition Let C be a convex code on n neurons. Suppose C is realized by U = { U 1 , U 2 , . . . , U n } where each U i ⊂ R d is convex. The minimal such d is the minimal embedding dimension of C . If we require all U i ∈ U to be open, the minimal such d is the minimal open embedding dimension of C . If we require all U i ∈ U to be closed, the minimal such d is the minimal closed embedding dimension of C . Franke (UCSB) Just Convex Realization July 17, 2017 15 / 21

  28. Minimal Embedding Dimension Definition Define C n to be the code on n neurons containing all codewords of length n − 1, C n = { σ | σ ⊆ [ n ] , | σ | = n − 1 } . � n � Note that |C n | = = n . n − 1 Franke (UCSB) Just Convex Realization July 17, 2017 16 / 21

  29. Minimal Embedding Dimension Definition Define C n to be the code on n neurons containing all codewords of length n − 1, C n = { σ | σ ⊆ [ n ] , | σ | = n − 1 } . � n � Note that |C n | = = n . n − 1 Theorem (F., Muthiah) For every n, C n has minimal embedding dimension n − 1 . Franke (UCSB) Just Convex Realization July 17, 2017 16 / 21

  30. Example Let C 3 = {∅ , 12 , 13 , 23 } and U = { U 1 , U 2 , U 3 } be a realization of C 3 . Franke (UCSB) Just Convex Realization July 17, 2017 17 / 21

  31. Example Let C 3 = {∅ , 12 , 13 , 23 } and U = { U 1 , U 2 , U 3 } be a realization of C 3 . Then there exists points a 12 , a 13 , and a 23 such that a 12 ∈ U 1 ∩ U 2 , a 13 ∈ U 1 ∩ U 3 , a 23 ∈ U 2 ∩ U 3 . Franke (UCSB) Just Convex Realization July 17, 2017 17 / 21

  32. Example Let C 3 = {∅ , 12 , 13 , 23 } and U = { U 1 , U 2 , U 3 } be a realization of C 3 . Then there exists points a 12 , a 13 , and a 23 such that a 12 ∈ U 1 ∩ U 2 , a 13 ∈ U 1 ∩ U 3 , a 23 ∈ U 2 ∩ U 3 . Suppose toward contradiction that C 3 has a realization in 1 dimension. Then, a 12 , a 13 , and a 23 must be collinear. Franke (UCSB) Just Convex Realization July 17, 2017 17 / 21

  33. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3

  34. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3 a 12

  35. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3 a 12 a 13

  36. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3 a 12 a 13

  37. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3 a 12 a 13 a 23

  38. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3 ⊆ U 2 a 12 a 13 a 23

  39. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3 ⊆ U 2 a 23 a 12 a 13 a 23

  40. Example C 3 = {∅ , 12 , 13 , 23 } a 12 ∈ U 1 ∩ U 2 a 13 ∈ U 1 ∩ U 3 a 23 ∈ U 2 ∩ U 3 ⊆ U 2 a 23 a 12 a 13 a 23 ⊆ U 3 Franke (UCSB) Just Convex Realization July 17, 2017 18 / 21

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

Minimal volume product of convex bodies with various symmetries Masataka Shibata Tokyo Institute

Minimal volume product of convex bodies with various symmetries Masataka Shibata Tokyo Institute

Minimal volume product of convex bodies with various symmetries Masataka Shibata Tokyo Institute of Technology 18 September, 2019 Conference on Convex, Discrete and Integral Geometry (Jena) joint work with Hiroshi Iriyeh (Ibaraki Univ.)

271 views • 15 slides
Embedding classical in minimal implicational logic Hajime Ishihara and Helmut Schwichtenberg

Embedding classical in minimal implicational logic Hajime Ishihara and Helmut Schwichtenberg

Embedding classical in minimal implicational logic Hajime Ishihara and Helmut Schwichtenberg Schoole of Information Science, Jaist, Japan and Mathematisches Institut, LMU, M unchen University of Bern, 19. June 2014 1 / 19 Context and

340 views • 22 slides
CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the

CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the

CS133 Computational Geometry Convex Hull 1 Convex Hull Given a set of n points, find the minimal convex polygon that contains all the points 2 Convex Hull Properties 3 Convex Hull Representation The convex hull is represented by all

1.07k views • 82 slides
Open questions and services Dimensions of cables and services Minimal cross section

Open questions and services Dimensions of cables and services Minimal cross section

Open questions and services Dimensions of cables and services Minimal cross section Routing possibilities PANDA Meeting, June 11 2014, D. Calvo on behalf of the MVD group A look in a running experiment! ALICE SDD cooling system A

400 views • 16 slides
CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points,

CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points,

CS133 Computational Geometry Convex Hull 4/12/2018 1 Convex Hull Given a set of n points, find the minimal convex polygon that contains all the points 4/12/2018 2 Convex Hull Properties 4/12/2018 3 Convex Hull Representation The

1.21k views • 81 slides
Computing Convex Hull (in 2D) Computational Geometry Convex hull Definition Geometry of

Computing Convex Hull (in 2D) Computational Geometry Convex hull Definition Geometry of

Yazd Univ. Computing Convex Hull (in 2D) Computational Geometry Convex hull Definition Geometry of problem 1st algorithm 2nd algorithm Proof of correctness 1393-1 Other algorithms Higher dimensions 1 / 20 Convex Set Definition: Yazd

531 views • 33 slides
Words of Minimal Weight and Weight Distribution in Binary Goppa Codes Matthieu Finiasz ISIT 2003

Words of Minimal Weight and Weight Distribution in Binary Goppa Codes Matthieu Finiasz ISIT 2003

Words of Minimal Weight and Weight Distribution in Binary Goppa Codes Matthieu Finiasz ISIT 2003 Yokohama Binary Goppa Codes Introduction Used for cryptography ( McEliece cryptosystem) Indistinguishable from a random linear code

138 views • 11 slides
Planarity Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns

Planarity Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns

Planarity Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates. 0 1 3 4 1 1 0 2 5 2 5

754 views • 18 slides
Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 )

Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 )

Graph Drawing Embedding Embedding For a given graph G = ( V , E ) , an embedding (into R 2 ) assigns each vertex a coordinate and each edge a (not necessarily straight) line connecting the corresponding coordinates. 0 1 3 4 1 1 0 2 5 2

541 views • 18 slides
Convex hull 1 - 1 Convex hull 1 - 2 Convex hull 1 - 3 Convex hull Definition, extremal

Convex hull 1 - 1 Convex hull 1 - 2 Convex hull 1 - 3 Convex hull Definition, extremal

Convex hull 1 - 1 Convex hull 1 - 2 Convex hull 1 - 3 Convex hull Definition, extremal point Jarvis algorithm Orientation predicate Buggy degenerate example Real RAM model and general position hypothesis Graham

1.41k views • 114 slides
Sampling of probability measures in the convex order and approximation of Martingale Optimal

Sampling of probability measures in the convex order and approximation of Martingale Optimal

Introduction Sampling in the convex order The dimension 1 case Sampling in the convex order in higher dimensions Numerical results Sampling of probability measures in the convex order and approximation of Martingale Optimal Transport problems

641 views • 37 slides
Output of a convex-hull algorithm: a, b, c, g, j A&DS Lecture 16 2 Mary Cryan Polar Angles

Output of a convex-hull algorithm: a, b, c, g, j A&DS Lecture 16 2 Mary Cryan Polar Angles

The Convex Hull Definition 16.1 (1) A set C of points is convex if for all p, q C the whole line segment pq is contained in C . (2) The convex hull of a set S of points is the smallest convex set C that contains S . Observation 16.2 The convex

290 views • 14 slides
Staggered Diagonal Embedding Based Linear Field Size Streaming Codes Vinayak Ramkumar * , Myna

Staggered Diagonal Embedding Based Linear Field Size Streaming Codes Vinayak Ramkumar * , Myna

Staggered Diagonal Embedding Based Linear Field Size Streaming Codes Vinayak Ramkumar * , Myna Vajha * , M. Nikhil Krishnan , P. Vijay Kumar * * Department of Electrical Communication Engineering, IISc Bangalore Department of Electrical and

520 views • 28 slides
A recursive algorithmic construction for spherical codes in dimensions R 2 k Henrique K. Miyamoto

A recursive algorithmic construction for spherical codes in dimensions R 2 k Henrique K. Miyamoto

A recursive algorithmic construction for spherical codes in dimensions R 2 k Henrique K. Miyamoto Henrique S a Earp e Sueli Costa Unicamp - University of Campinas miyamotohk@gmail.com July 9, 2018 Henrique K. Miyamoto LAWCI July 9, 2018

277 views • 6 slides
3.1 Online Convex Programming Definition 3.1.1 (Convex Set) A set of vectors X R n is convex

3.1 Online Convex Programming Definition 3.1.1 (Convex Set) A set of vectors X R n is convex

CS/CNS/EE 253: Advanced Topics in Machine Learning Topic: Online Gradient Descent Lecturer: Daniel Golovin Scribe: Esther Wang Date: Jan. 11, 2010 3.1 Online Convex Programming Definition 3.1.1 (Convex Set) A set of vectors X R n is convex if

93 views • 5 slides
ex Gray Codes = reflected binary codes Karnaugh Maps: find (minimal) sums of products CD gray

ex Gray Codes = reflected binary codes Karnaugh Maps: find (minimal) sums of products CD gray

But first Recall: sum of products logical sum (OR) of products (AND) 1. Basic combinational building blocks of inputs or their complements (NOT). 2. Logic for arithmetic Construct with: A B C M 1 code detector per 1-valued output

687 views • 6 slides
On the Failure of BD- N Robert S. Lubarsky Florida Atlantic University Constructive Mathematics:

On the Failure of BD- N Robert S. Lubarsky Florida Atlantic University Constructive Mathematics:

Introduction Topological Example Application Realizability Models Questions References On the Failure of BD- N Robert S. Lubarsky Florida Atlantic University Constructive Mathematics: Proofs and Computation Fraueninsel, Chiemsee June

1.25k views • 68 slides
Be Beyond Poly olyhedral Analysis of of OpenStream Programs Nun uno Mi Migu guel l Nob

Be Beyond Poly olyhedral Analysis of of OpenStream Programs Nun uno Mi Migu guel l Nob

Be Beyond Poly olyhedral Analysis of of OpenStream Programs Nun uno Mi Migu guel l Nob obre nunomiguel.nobre@manchester.ac.uk Join oint work ork wi with: Andi Drebes, Graham Riley and Antoniu Pop IMPACT 2019: January 23, 2019 |

743 views • 38 slides
Compiling for Parallelism & Locality Last time SSA and its uses Today

Compiling for Parallelism & Locality Last time SSA and its uses Today

Compiling for Parallelism & Locality Last time SSA and its uses Today Parallelism and locality Data dependences and loops CS553 Lecture Compiling for Parallelism & Locality 1 The Problem: Mapping programs

660 views • 18 slides
Algorithmic Complexity II Department of Computer Science University of Maryland, College Park

Algorithmic Complexity II Department of Computer Science University of Maryland, College Park

CMSC 132: Object-Oriented Programming II Algorithmic Complexity II Department of Computer Science University of Maryland, College Park Announcements Regarding Friday before spring break Analyzing Algorithms Goal Find asymptotic

586 views • 14 slides
1 Reduction in Strength Compiler-Generated Code Motion (-O1) void set_row(double *a, double *b,

1 Reduction in Strength Compiler-Generated Code Motion (-O1) void set_row(double *a, double *b,

Today Overview Generally Useful Optimizations Program Optimization Code motion/precomputation Strength reduction Sharing of common subexpressions CSci 2021: Machine Architecture and Organization Removing unnecessary

459 views • 11 slides
Lecture 21: Tree codes David Bindel 12 Apr 2010 Logistics April 19, SCAN seminar: Padma

Lecture 21: Tree codes David Bindel 12 Apr 2010 Logistics April 19, SCAN seminar: Padma

Lecture 21: Tree codes David Bindel 12 Apr 2010 Logistics April 19, SCAN seminar: Padma Raghavan April 21, guest lecture: Charlie Van Loan Recurring theme Lots of problems can be partitioned as A coarse problem that captures

519 views • 24 slides
Formal Loop Merging for Signal Transforms Franz Franchetti Yevgen S. Voronenko Markus Pschel

Formal Loop Merging for Signal Transforms Franz Franchetti Yevgen S. Voronenko Markus Pschel

Formal Loop Merging for Signal Transforms Franz Franchetti Yevgen S. Voronenko Markus Pschel Department of Electrical & Computer Engineering Carnegie Mellon University This work was supported by NSF through awards 0234293, and 0325687.

574 views • 32 slides
Mehdi Azarmi Your default shell? (Bash or Tcsh) %echo $SHELL You may change your

Mehdi Azarmi Your default shell? (Bash or Tcsh) %echo $SHELL You may change your

Mehdi Azarmi Your default shell? (Bash or Tcsh) %echo $SHELL You may change your default shell %chsh USERNAME /bin/bash More in the CS help page http://www.cs.purdue.edu/resources/facilities/oracle/cs.sxhtml Note te :

92 views • 5 slides

More recommend