Are you over 18 and want to see adult content?

# More Annotations

Â«Ð¤Ð°Ñ€Ð°Ð´Ð¶Â» â€” Ð¸Ð½Ñ‚ÐµÑ€Ð½ÐµÑ‚-Ð¼Ð°Ð³Ð°Ð·Ð¸Ð½ Ð²Ð¾ÑÑ‚Ð¾Ñ‡Ð½Ñ‹Ñ… Ñ‚Ð¾Ð²Ð°Ñ€Ð¾Ð² Ð² ÐœÐ¾ÑÐºÐ²Ðµ

Are you over 18 and want to see adult content?

Web Development and prototyping - Robie Blair

Are you over 18 and want to see adult content?

Ahora Me Dedico Al Cacharreo

Are you over 18 and want to see adult content?

Tapeter & FÃ¤rg Online - Snabb leverans âœ” - KÃ¶p online hos Tapethandeln.se

Are you over 18 and want to see adult content?

ERUPT YOUR SALES! - Steadfast Results

Are you over 18 and want to see adult content?

Cuesoul Darts and Billiards Official Store Online

Are you over 18 and want to see adult content?

ESCUCHAR MUSICA MP3 GRATIS - Escuchar Musica Online HD - www.gomusica.com

Are you over 18 and want to see adult content?

# Favourite Annotations

Create an Ecommerce Website and Sell Online! Ecommerce Software by Shopify

Are you over 18 and want to see adult content?

News & Info for Australian HR-IR Professionals - WorkplaceInfo

Are you over 18 and want to see adult content?

Film Advance - The photographic adventures and musings of Gary SeronikFilm Advance

Are you over 18 and want to see adult content?

Flyerbox.ca - Online flyers and Catalogue!

Are you over 18 and want to see adult content?

Poder JudiciÃ¡rio do Estado de Mato Grosso

Are you over 18 and want to see adult content?

Salvaged Gold & Salvaged Silver Jewellery â€“ Lylie's

Are you over 18 and want to see adult content?

# Text

### MARCH 7, 2019

THE TOPOLOGY OF NEURAL NETWORKS, PART 2: COMPOSITIONS AND DIMENSIONS Filed under: Uncategorized### — Jesse

### Johnson @ 10:32 pm

In Part 1 of this series### ,

I gave an abstract description of one of the main problems in Machine Learning, the Generalization Problem, in which one uses the values of a function at a finite number of points to infer the entire function. The typical approach to this problem is to choose a finite-dimensional subset of the space of all possible functions, then choose the function from this family that minimizes something called _cost function_, defined by how accurate each function is on the sampled points. In this post, I will describe how the regression example from the last post generalizes to a family of models called Neural Networks, then describe how I recently used some fairly basic topology to demonstrate restrictions on the types of functions certain neural networks can produce.### (more…)

### Advertisements

### Report this ad

### Report this ad

### Comments (1)

### OCTOBER 21, 2018

THE TOPOLOGY OF NEURAL NETWORKS, PART 1: THE GENERALIZATION PROBLEM Filed under: Uncategorized### — Jesse

### Johnson @ 10:21 am

I gave a talk a few months ago at the Thompson-Scharlemann-Kirby### conference about

a theorem I recently proved about topological limitations on certain families of neural networks. Most of the talk was a description of how neural networks work in terms of more abstract mathematics than they’re typically described in, and I thought this was probably a good thing to write up in a blog post. I decided to split the post into two parts because it was getting quite long. So the first post will describe the general approach to defining Machine Learning models, and the second post will cover Neural Networks in particular.### (more…)

### Comments (5)

### APRIL 4, 2018

TWO WIDELY-BELIEVED CONJECTURES. ONE IS FALSE. Filed under: Uncategorized### —

dmoskovich @ 12:10 pm I haven’t blogged for a long time- for the last few years, my research has been leading me away from low dimensional topology and more towards foundations of quantum physics. You can read my latest paper on the topic HERE . Today I’d like to tell you about a preprint by Malyutin, that shows that two widely believed knot theory conjectures are mutually### exclusive!

> A Malyutin, _On the Question of Genericity of Hyperbolic Knots_, > https://arxiv.org/abs/1612.03368. CONJECTURE 1: Almost all prime knots are hyperbolic. More precisely, the proportion of hyperbolic knots amongst all prime knots of or fewer crossings approaches 1 as approaches . CONJECTURE 2: The crossing number (the minimal number of crossings of a knot diagram of that knot) of a composite knot is not less than that of each of its factors. (more…)### Comments (6)

### DECEMBER 19, 2017

COMPUTATION IN GEOMETRIC TOPOLOGY Filed under: 3-manifolds### ,4-manifolds

### ,Computation

### and experiment

### ,Hyperbolic

### geometry

### ,Triangulations

### ,Uncategorized

### — Nathan

### Dunfield @ 10:40 am

Complete lecture videos for last week’s workshop _Computation in Geometric Topology_ at Warwick are now posted on YouTube. The complete list of talks with abstracts and video links is here### .

### Comments (1)

### SEPTEMBER 14, 2017

WHAT IS THE COMPLEXITY OF THE HOMEOMORPHISM PROBLEM? Filed under: Uncategorized### —

dmoskovich @ 4:19 am Homeomorphism Problems are the guiding problems of low-dimensional topology: Given two topological objects, determine whether or not they are homeomorphic to one another. A lot of topology is tangential to this problem- we may define invariants, investigate their properties, and prove relationships between them, but we rarely directly touch on the Homeomorphism Problem. Direct progress on the Homeomorphism Problem is a big deal! I’m excited by a number of new and semi-new papers by Greg Kuperberg and collaborators. From my point of view, the most interesting of all### is:

> G. Kuperberg, _Algorithmic homeomorphism of -manifolds as a > corollary of geometrization_, > http://front.math.ucdavis.edu/1508.06720 This paper contains two results: 1) That Geometrization implies that there exists a recursive algorithm to determine whether two closed oriented –manifolds are### homeomorphic.

2) Result (1), except with the words “elementary recursive” replacing the words “recursive”. Result (1) is sort-of a well-known folklore theorem, and is essentially due to Riley and Thurston (with lots of subsections of it obtaining newer fancier proofs in the interim), but no full self-contained proof had appeared for it in one place until now. It’s great to have one- moreover, a proof which uses only the tools that were available in the 1970’s. Knowing that we have a recursive algorithm, the immediate and important question is the complexity class of the best algorithm. Kuperberg has provided a worst-case bound, but “elementary recursive” is a generous computational class. The real question I think, and one that is asked at the end of the paper, is where exactly the homeomorphism problem falls on the heirarchy of complexity### classes:

And whether the corresponding result holds for compact –manifolds with boundary, and for non-orientable –manifolds.### Comments (2)

### MARCH 18, 2017

A NEW “MATHEMATICIAN’S APOLOGY”### Filed under: Misc.

— Jesse Johnson @ 8:18 am In the two and a half years (or so) since I left academia for industry, I’ve worked with a number of math majors and math PhDs outside of academia and talked to a number of current grad students who were considering going into industry. As a result, my perspective on the role of the math research community within the larger world has changed quite a bit from what it was in the early days of may academic career. In the post below, I explore this new perspective.### (more…)

### Comments (12)

### MARCH 3, 2017

OFFICE HOUSE WITH A GEOMETRIC GROUP THEORIST Filed under: Geometric Group Theory — dmoskovich @ 9:49 am It’s hard enough for one author to write a coherent work; for many authors, even if it’s one and the same topic one might end up with Rashoumon (in the sense of different and contradicting narratives). But, as the Princeton Companion to Mathematics shows, it is possible to have a coherent book with each author writing a chapter, and now geometric group theory has one too. A new book has just come out, and it’s very good. > OFFICE HOURS WITH A GEOMETRIC GROUP THEORIST > , Edited by Matt Clay > & Dan Margalit, 2017. An undergraduate student walks into the office of a geometric group theorist, curious about the subject and perhaps looking for a senior thesis topic. The researcher pitches their favourite sub-topic to the student in a single “office hour”. The book collects together 16 independent such “office hours”, plus two introductory office hours by the editors (Matt Clay and Dan Margalit) to get the student off the ground. (more…)### Comments (1)

### OCTOBER 7, 2016

A BIRD’S EYE VIEW OF TOPOLOGICAL RECURSION Filed under: Quantum topology### —

dmoskovich @ 8:53 am Eynard-Orantin Theory (topological recursion) has got to be one of the biggest ideas in quantum topology in recent years (see also HERE### ).

Today I’d like to attempt a bird’s eye explanation of what all the excitement is about from the perspective of low-dimensional topology.### (more…)

### Comments (1)

### OCTOBER 2, 2016

A GORGEOUS BUT INCOMPLETE PROOF OF “THE SMALE CONJECTURE” Filed under: 3-manifolds### ,Algebraic

### topology

### ,Smooth

### Topology

### ,Uncategorized

### — Ryan

### Budney @ 10:33 pm

In 1959 Stephen Smale gave a proof that the group of diffeomorphisms of the 2-sphere has the homotopy-type of the subgroup of linear diffeomorphisms, i.e. the Lie Group O_3. His proof went in two### steps: (more…)

### Comments (5)

### JULY 15, 2016

POSTDOCTORAL POSITIONS- CALL FOR APPLICATIONS Filed under: Uncategorized### —

dmoskovich @ 9:12 am I’m pleased to announce that we have been awarded Israel Science Foundation (ISF) to support 2-year postdoctoral positions at Ben-Gurion University of the Negev### , to work on Tangle

Machines and low-dimensional topological approaches to information theory. Interested applicants may contact me or Avishy Carmi at avcarmi@bgu.ac.il . We’re looking toward developing applications, so we’re primarily searching for people who can program and maybe who have some signal processing knowledge. So primarily for computer science postdocs, I### suppose.

An official announcement will be posted at relevant places in due time- but you heard it here first (^_^)### Comments (2)

### Next Page »

### *

### Search for:

### *

### BLOG INFO

### * About

### * Conferences

### * Open Problems

### *

### LINKS

* AMS Conference Calendar### * ArXiv.org

* Brittenham’s Conference List### * CompuTop software

* Conference Service Geometry/Topology listings * CRM workshop calendar (Italy)### * MathSciNet

* Topology Atlas Conference List * UC Davis math Front * UTK Geometry Listserv### *

### OTHER MATH BLOGS

### * 11011110

### * Alex Sisto's blog

### * Applied Topology

* Geometric Group Theory * Geometry and the Imagination### * God plays dice

* Ian Agol’s Blog (archive) * MathBlogging.org Blog List * Noncommutative Geometry * Quantum Tetrahedron * Secret Blogging Seminar * Sketches of Topology * Terence Tao’s Blog * The Geometric Viewpoint * Tim Gower’s Blog### *

### RECENT POSTS

* The Topology of Neural Networks, Part 2: Compositions### and Dimensions

* The Topology of Neural Networks, Part 1: The Generalization Problem * Two widely-believed conjectures. One is false. * Computation in geometric topology * What is the complexity of the homeomorphism problem? * A new “Mathematician’s Apology” * Office House with a Geometric Group Theorist * A bird’s eye view of topological recursion * A gorgeous but incomplete proof of “The Smale Conjecture” * Postdoctoral positions- call for applications### *

### RECENT COMMENTS

นักเตะดัง on … or### Agol’s T…

### film ça streaming

on Some thoughts on the Kirby… Ryan Budney on Two widely-believed conjecture… Film complet vf on Dispatches from the### Dark …

Dmca on The Topology of Neural### Network…

Film streaming compl… on More on mapping class gro… Stream complet on Jones’s new### polynomial

Jesse Johnson on The Topology of Neural Network… Jesse Johnson on The Topology of Neural Network… Bootstamp on The Topology of Neural Network…### *

### ARCHIVES

Archives Select Month March 2019 (1) October 2018 (1) April 2018 (1) December 2017 (1) September 2017 (1) March 2017 (2) October 2016 (2) July 2016 (1) May 2016 (1) April 2016 (1) March 2016 (1) February 2016 (1) December 2015 (1) November 2015 (2) September 2015 (2) August 2015 (2) July 2015 (2) June 2015 (3) May 2015 (1) March 2015 (3) January 2015 (3) December 2014 (1) November 2014 (2) October 2014 (1) September 2014 (2) July 2014 (2) June 2014 (2) May 2014 (1) April 2014 (2) March 2014 (3) January 2014 (1) December 2013 (1) November 2013 (3) October 2013 (2) September 2013 (1) July 2013 (3) June 2013 (1) May 2013 (4) April 2013 (5) March 2013 (2) February 2013 (4) January 2013 (2) December 2012 (1) November 2012 (2) October 2012 (2) September 2012 (2) August 2012 (4) July 2012 (5) June 2012 (4) May 2012 (4) April 2012 (5) March 2012 (7) February 2012 (3) January 2012 (5) November 2011 (3) October 2011 (2) September 2011 (2) August 2011 (2) July 2011 (3) June 2011 (5) May 2011 (6) April 2011 (4) March 2011 (1) February 2011 (4) January 2011 (4) December 2010 (2) November 2010 (2) October 2010 (2) September 2010 (2) July 2010 (3) June 2010 (1) May 2010 (1) April 2010 (1) March 2010 (1) February 2010 (3) January 2010 (6) December 2009 (2) November 2009 (1) October 2009 (4) September 2009 (6) August 2009 (10) July 2009 (2) June 2009 (2) April 2009 (1) March 2009 (6) February 2009 (8) January 2009 (3) December 2008 (5) November 2008 (6) October 2008 (7) September 2008 (4) August 2008 (2) July 2008 (9) June 2008 (6) May 2008 (7) April 2008 (6) March 2008 (5) February 2008 (6) January 2008 (7) December 2007 (5) November### 2007 (14)

### *

Subscribe via rss to entries### or comments .

### *

### *

### *

### META

### * Register

### * Log in

### * Entries RSS

### * Comments RSS

### * WordPress.com

Blog at WordPress.com. Privacy & Cookies: This site uses cookies. By continuing to use this website, you agree to their use. To find out more, including how to control cookies, see here: Cookie### Policy

### * Follow

### *

* Low Dimensional Topology### * Customize

### * Follow

### * Sign up

### * Log in

* Report this content * Manage subscriptions### * Collapse this bar

# Details

Copyright © 2022 ArchiveBay.com. All rights reserved. Terms of Use | Privacy Policy | DMCA | 2021 | Feedback | Advertising | RSS 2.0