Dynamic Embedding on Textual Networks via a Gaussian Process - PowerPoint PPT Presentation

Oct 24, 2022 •362 likes •527 views

Dynamic Embedding on Textual Networks via a Gaussian Process Presenter : Pengyu Cheng Joint work with : Yitong Li, Xinyuan Zhang, Liqun Chen, David Carlson, Lawrence Carin Duke University Textual Networks Networks with textual information as

Dynamic Embedding on Textual Networks via a Gaussian Process Presenter : Pengyu Cheng Joint work with : Yitong Li, Xinyuan Zhang, Liqun Chen, David Carlson, Lawrence Carin Duke University
Textual Networks • Networks with textual information as attributes from each node. • Examples: Tasks on textual networks: • • Citation Networks • Link Prediction • Node Classification • Social Networks • Etc. I am a NLP reseacher I apply deep I am studying learning into deep learning NLP

Recommend

Greedy embedding of a graph Greedy embedding of a graph 99 Greedy embedding Greedy embedding

Given a graph, find an embedding s.t. greedy routing works Greedy embedding of a graph Greedy embedding of a graph 99 Greedy embedding Greedy embedding Given a graph G, find an embedding of the vertices in R d , s.t. for each pair of

366 views • 23 slides

Textual Criticism Textual Criticism: Definition Textual criticism is the study of copies of

Textual Criticism Textual Criticism: Definition Textual criticism is the study of copies of any written work of which the autograph (the original) is unknown, with the purpose of ascertaining the original text. J. Harold Greenlee, New

927 views • 60 slides

Dynamic memory networks for Dynamic memory networks for visual and textual question visual and

Dynamic memory networks for Dynamic memory networks for visual and textual question visual and textual question answering answering Stephen Merity (@smerity) Joint work with the MetaMind team: Caiming Xiong, Richard Socher, and more

382 views • 33 slides

Embedding 3-manifolds via surgery on surfaces Kyle Larson University of Texas at Austin

Embedding 3-manifolds via surgery on surfaces Embedding 3-manifolds via surgery on surfaces Kyle Larson University of Texas at Austin klarson@math.utexas.edu June 12th, 2015 Embedding 3-manifolds via surgery on surfaces Embedding 3-manifolds

975 views • 54 slides

Gaussian Filter The Gaussian filter 1 2 1 A Gaussian kernel gives less 1 2 4 2 weight to

Gaussian Filter The Gaussian filter 1 2 1 A Gaussian kernel gives less 1 2 4 2 weight to pixels further from 16 the center of the window 1 2 1 This kernel is an approximation of a Gaussian function Gaussian filtering versus mean

405 views • 11 slides

Lecture 3 Capacity of Multiuser Gaussian Channels The Gaussian uplink: 6.1 The fading

Lecture 3 Capacity of Multiuser Gaussian Channels The Gaussian uplink: 6.1 The fading Gaussian uplink: 6.3 (parts) The Gaussian downlink: 6.2 The fading Gaussian downlink: 6.4 (parts) Mikael Skoglund, Theoretical Foundations of

354 views • 10 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 ) 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

557 views • 18 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 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

755 views • 18 slides

Non-Gaussian likelihoods for Gaussian Processes Alan Saul Outline Motivation Non-Gaussian

Non-Gaussian likelihoods for Gaussian Processes Alan Saul Outline Motivation Non-Gaussian posteriors Approximate methods Laplace approximation Variational bayes Expectation propagation Comparisons GP regression - recap so far Model the

1.41k views • 113 slides

CS70: Jean Walrand: Lecture 36. Gaussian and CLT CS70: Jean Walrand: Lecture 36. Gaussian and

CS70: Jean Walrand: Lecture 36. Gaussian and CLT CS70: Jean Walrand: Lecture 36. Gaussian and CLT Warning: CS70: Jean Walrand: Lecture 36. Gaussian and CLT Warning: This lecture is also rated R. CS70: Jean Walrand: Lecture 36. Gaussian and

1.53k views • 120 slides

Faster Gaussian Lattice Sampling using Information Leakage Gaussian Sampling Our Work Lazy

Faster Gaussian Lattice Sampling using Lazy FPA L. Ducas P.Q. Nguyen Introduction Lattices based Signatures Before Gaussian Sampling Preventing Faster Gaussian Lattice Sampling using Information Leakage Gaussian Sampling Our Work Lazy

986 views • 67 slides

Natural logic and textual inference Bill MacCartney CS224U 12 May 2014 Textual inference

Natural logic and textual inference Bill MacCartney CS224U 12 May 2014 Textual inference examples P. A Revenue Cutter, the ship was named for Harriet Lane, niece of President James Buchanan, who served as Buchanans White House hostess.

926 views • 62 slides

Design and Realization of the EXCITEMENT Open Platform for Textual Entailment Gnter Neumann,

Design and Realization of the EXCITEMENT Open Platform for Textual Entailment Gnter Neumann, DFKI Sebastian Pado, Universitt Stuttgart Textual Entailment Textual Entailment (TE) A Text (T) entails a Hypothesis (H), if a typical

321 views • 27 slides

Textual Entailment Alina Petrova EMCL TUD, HLT FBK February 22, 2012 Alina Petrova EMCL TUD,

Textual Entailment Alina Petrova EMCL TUD, HLT FBK February 22, 2012 Alina Petrova EMCL TUD, HLT FBK Textual Entailment Introduction Textual Entailment (TE): What is it? a notion from classical logic is applied to natural language

677 views • 23 slides

Gaussian Process Lei Tang Arizona State University Jul. 31th, 2007 Lei Tang (ASU) Gaussian

Gaussian Process Lei Tang Arizona State University Jul. 31th, 2007 Lei Tang (ASU) Gaussian Process Jul. 31th, 2007 1 / 22 Gaussian Process, (kriging in geostatistics) Autoregressive moving average model, Kalman filters, and radial basis

341 views • 31 slides

CSci 8980: Advanced Topics in Graphical Models Gaussian Processes Instructor: Arindam Banerjee

CSci 8980: Advanced Topics in Graphical Models Gaussian Processes Instructor: Arindam Banerjee November 15, 2007 Gaussian Processes Outline Gaussian Processes Outline Parametric Bayesian Regression Gaussian Processes Outline Parametric

572 views • 40 slides

AnImprovedAnalytical SuperscalarMicroprocessor MemoryModel MemoryModel

AnImprovedAnalytical SuperscalarMicroprocessor MemoryModel MemoryModel XiChenandTorAamodt ElectricalandComputerEngineering UniversityofBritishColumbia June22 nd ,2008(MoBS-2008)

680 views • 31 slides

Probability: Terminology and Examples 18.05 Spring 2014 Jeremy Orloff and Jonathan Bloom Discussion

Probability: Terminology and Examples 18.05 Spring 2014 Jeremy Orloff and Jonathan Bloom Discussion Boards April 22, 2014 2 / 22 Board Question Deck of 52 cards 13 ranks : 2, 3, . . . , 9, 10, J, Q, K, A 4 suits : , , , , Poker hands

794 views • 24 slides

COL863: Quantum Computation and Information Ragesh Jaiswal, CSE, IIT Delhi Ragesh Jaiswal, CSE,

COL863: Quantum Computation and Information Ragesh Jaiswal, CSE, IIT Delhi Ragesh Jaiswal, CSE, IIT Delhi COL863: Quantum Computation and Information Quantum Computation: Quantum Circuits Ragesh Jaiswal, CSE, IIT Delhi COL863: Quantum

394 views • 20 slides

1/4 2/3 B G 1/4 1/2 1 randomwalk.1 randomwalk.2 AlbertRMeyer, May13,2015

Graph With Probable Mathematics for Computer Science Transitions MIT 6.042J/18.062J Outgoingedge 1/3 probabilities O sumto1 Random Walks 1/4 2/3 B G 1/4 1/2 1 randomwalk.1 randomwalk.2 AlbertRMeyer, May13,2015

553 views • 5 slides

Approximate Factor Analysis Models Lorenzo Finesso, Peter Spreij Brixen July 19, 2007

Approximate Factor Analysis Models Lorenzo Finesso, Peter Spreij Brixen July 19, 2007 1 0 0 1 1 0 P 1 = 2 2 1 1 0 2 2 1 1 2 0 2 1 1 P 2 = 2 0 2

453 views • 17 slides

Gravitational Waves from Phase Transition in a QCD-like hidden sector Mayumi Aoki (Kanazawa

Gravitational Waves from Phase Transition in a QCD-like hidden sector Mayumi Aoki (Kanazawa University) In collaboration with J. Kubo (Toyama U.) Work in progress MA, Goto, Kubo, PRD 96 (2017) Sep. 9-13, 2019 TAUP2019 @ TOYAMA Introduction

473 views • 21 slides

Computing Nearby Non-Trivial Smith Forms Joseph Haraldson with Mark Giesbrecht and George Labahn

Introduction Theory SNF via Optimization Examples Conclusion Computing Nearby Non-Trivial Smith Forms Joseph Haraldson with Mark Giesbrecht and George Labahn David R. Cheriton School of Computer Science University of Waterloo July 18,

575 views • 30 slides

Mesh Simplification Mesh Simplification 1 Spring 2010 The The Law The The Law Law of Law

Mesh Simplification Mesh Simplification 1 Spring 2010 The The Law The The Law Law of Law of of Cosine of Cosine Cosine Cosine Here are some commonly used formulas. First, we learn that c 2 = a 2 + b 2 2 ab cos( ), where

983 views • 61 slides

Download document

More recommend

Explore More Topics

Stay informed with curated content and fresh updates.

animals pets art culture automotive transportation business finance computer internet construction architecture education-career electronics communication