Embedding Logical Queries on Knowledge Graphs
Will Hamilton, Payal Bajaj, Marinka Zitnik, Dan Jurafsky, Jure Leskovec
Learning low-dimensional embeddings of knowledge graphs is a powerful approach used to predict unobserved or missing edges between entities. However, an open challenge in this area is developing techniques that can go beyond simple edge prediction and handle more complex logical queries, which might involve multiple unobserved edges, entities, and variables. For instance, given an incomplete biological knowledge graph, we might want to predict what drugs are likely to target proteins involved with both diseases X and Y?--a query that requires reasoning about all possible proteins that might interact with diseases X and Y. Here we introduce a framework to efficiently make predictions about conjunctive logical queries--a flexible but tractable subset of first-order logic--on incomplete knowledge graphs. In our approach, we embed graph nodes in a low-dimensional space and represent logical operators as learned geometric operations (e.g., translation, rotation) in this embedding space. By performing logical operations within a low-dimensional embedding space, our approach achieves a time complexity that is linear in the number of query variables, compared to the exponential complexity required by a naive enumeration-based approach. We demonstrate the utility of this framework in two application studies on real-world datasets with millions of relations: predicting logical relationships in a network of drug-gene-disease interactions and in a graph-based representation of social interactions derived from a popular web forum.
This AI-powered Photoshop alternative is only 60
TL;DR: PicWish is an easy-to-use AI photo editor that lets you enhance, retouch, and batch edit images, and it's only 60 for life. Creating clean, professional-looking images can be time-consuming, especially if you're not experienced with photo editing software. PicWish offers a simpler solution. Designed for content creators, online sellers, and small business owners, this AI-powered image editor makes it easy to enhance, edit, and retouch photos in just a few clicks. While it's on sale, you can get PicWish for only 59.99 (reg.
I switched my 1,000 desktop for a 300 mini PC. I regret nothing
I didn't expect it to change my entire computing setup. But here I am now, using the 300 Beelink SER5 Mini PC as my daily workhorse, powering an ultrawide 1440p 100Hz monitor and smoothly handling any productivity task I've thrown at it. This little computer has been so delightful to use that I've relegated my full-sized desktop tower PC to the basement television, where it's now serving exclusively as a gaming rig. Consider this a lesson on technological overkill. Outside of some specialized use cases, the required compute power for getting things done might be a lot less than you think.
Bandit Learning with Implicit Feedback Yi Qi
Implicit feedback, such as user clicks, although abundant in online information service systems, does not provide substantial evidence on users' evaluation of system's output. Without proper modeling, such incomplete supervision inevitably misleads model estimation, especially in a bandit learning setting where the feedback is acquired on the fly. In this work, we perform contextual bandit learning with implicit feedback by modeling the feedback as a composition of user result examination and relevance judgment. Since users' examination behavior is unobserved, we introduce latent variables to model it. We perform Thompson sampling on top of variational Bayesian inference for arm selection and model update. Our upper regret bound analysis of the proposed algorithm proves its feasibility of learning from implicit feedback in a bandit setting; and extensive empirical evaluations on click logs collected from a major MOOC platform further demonstrate its learning effectiveness in practice.
Spectral Filtering for General Linear Dynamical Systems
Elad Hazan, Holden Lee, Karan Singh, Cyril Zhang, Yi Zhang
We give a polynomial-time algorithm for learning latent-state linear dynamical systems without system identification, and without assumptions on the spectral radius of the system's transition matrix. The algorithm extends the recently introduced technique of spectral filtering, previously applied only to systems with a symmetric transition matrix, using a novel convex relaxation to allow for the efficient identification of phases.