Next
Livestream will start soon!
Livestream has already ended.
Presentation has not been recorded yet!
  • title: Learning Interpretable, Tree-Based Projection Mappings for Nonlinear Embeddings
      0:00 / 0:00
      • Report Issue
      • Settings
      • Playlists
      • Bookmarks
      • Subtitles Off
      • Playback rate
      • Quality
      • Settings
      • Debug information
      • Server sl-yoda-v2-stream-002-alpha.b-cdn.net
      • Subtitles size Medium
      • Bookmarks
      • Server
      • sl-yoda-v2-stream-002-alpha.b-cdn.net
      • sl-yoda-v2-stream-002-beta.b-cdn.net
      • 1001562353.rsc.cdn77.org
      • 1075090661.rsc.cdn77.org
      • Subtitles
      • Off
      • English
      • Playback rate
      • Quality
      • Subtitles size
      • Large
      • Medium
      • Small
      • Mode
      • Video Slideshow
      • Audio Slideshow
      • Slideshow
      • Video
      My playlists
        Bookmarks
          00:00:00
            Learning Interpretable, Tree-Based Projection Mappings for Nonlinear Embeddings
            • Settings
            • Sync diff
            • Quality
            • Settings
            • Server
            • Quality
            • Server

            Learning Interpretable, Tree-Based Projection Mappings for Nonlinear Embeddings

            Mar 28, 2022

            Speakers

            AZ

            Arman Zharmagambetov

            Speaker · 0 followers

            MÁC

            Miguel Á. Carreira-Perpinan

            Speaker · 0 followers

            About

            Nonlinear embeddings that are based on neighborhood graphs (such as t-SNE) are popular dimensionality reduction methods that can effectively visualize high-dimensional data. However, they are typically non-parametric and cannot be directly applied to out-of-sample points. This problem is typically addressed by learning a parametric mapping (e.g. neural nets) which projects inputs into low-dimensional manifold. Although a number of methods exist to train various mappings, only few of them conside…

            Organizer

            A2
            A2

            AISTATS 2022

            Account · 35 followers

            About AISTATS 2022

            AISTATS is an interdisciplinary gathering of researchers at the intersection of computer science, artificial intelligence, machine learning, statistics, and related areas. Since its inception in 1985, the primary goal of AISTATS has been to broaden research in these fields by promoting the exchange of ideas among them. We encourage the submission of all papers which are in keeping with this objective at AISTATS.

            Like the format? Trust SlidesLive to capture your next event!

            Professional recording and live streaming, delivered globally.

            Sharing

            Recommended Videos

            Presentations on similar topic, category or speaker

            Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization
            05:04

            Regret Bounds for Expected Improvement Algorithms in Gaussian Process Bandit Optimization

            Hung Tran-The, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Efficient and passive learning of networked dynamical systems driven by non-white exogenous inputs
            04:44

            Efficient and passive learning of networked dynamical systems driven by non-white exogenous inputs

            Harish Doddi, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            LPF-SGD for Recovering Flat Optima in the DL Optimization Landscape
            04:49

            LPF-SGD for Recovering Flat Optima in the DL Optimization Landscape

            Devansh Bisla, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Being a Bit Frequentist Improves Bayesian Neural Networks
            04:22

            Being a Bit Frequentist Improves Bayesian Neural Networks

            Agustinus Kristiadi, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Fast and accurate optimization on the orthogonal manifold without retraction
            05:18

            Fast and accurate optimization on the orthogonal manifold without retraction

            Pierre Ablin, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            A Global-view Based Defense via Adversarial Attack and Defense Risk Guaranteed Bounds
            05:07

            A Global-view Based Defense via Adversarial Attack and Defense Risk Guaranteed Bounds

            Trung Le, …

            A2
            A2
            AISTATS 2022 3 years ago

            Total of 0 viewers voted for saving the presentation to eternal vault which is 0.0%

            Interested in talks like this? Follow AISTATS 2022