E. Shutova, D. Kiela, and J. Maillard. Black holes and
white rabbits: Metaphor identification with visual
features. In Proc. of the 2016 Conference of the North
American Chapter of the Association for
Computational Linguistics: Human Language
Technologies, pages 160–170, San Diego, California,
June 2016. Association for Computational Linguistics
Abstract:
Sarcasm is a peculiar form of sentiment expression, where the surface sentiment differs from the implied sentiment. The detection of sarcasm in social media platforms has been applied in the past mainly to textual utterances where lex- ical indicators (such as interjections and intensifiers), lin- guistic markers, and contextual information (such as user profiles, or past conversations) were used to detect the sar- castic tone. However, modern social media platforms allow to create multimodal messages where audiovisual content is integrated with the text, making the analysis of a mode in isolation partial. In our work, we first study the relation- ship between the textual and visual aspects in multimodal posts from three major social media platforms, i.e., Insta- gram, Tumblr and Twitter, and we run a crowdsourcing task to quantify the extent to which images are perceived as necessary by human annotators. Moreover, we propose two different computational frameworks to detect sarcasm that integrate the textual and visual modalities. The first approach exploits visual semantics trained on an external dataset, and concatenates the semantics features with state- of-the-art textual features. The second method adapts a vi- sual neural network initialized with parameters trained on ImageNet to multimodal sarcastic posts. Results show the positive effect of combining modalities for the detection of sarcasm across platforms and methods.
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...Subhajit Sahu
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
Levelwise PageRank with Loop-Based Dead End Handling Strategy : SHORT REPORT ...Subhajit Sahu
Abstract — Levelwise PageRank is an alternative method of PageRank computation which decomposes the input graph into a directed acyclic block-graph of strongly connected components, and processes them in topological order, one level at a time. This enables calculation for ranks in a distributed fashion without per-iteration communication, unlike the standard method where all vertices are processed in each iteration. It however comes with a precondition of the absence of dead ends in the input graph. Here, the native non-distributed performance of Levelwise PageRank was compared against Monolithic PageRank on a CPU as well as a GPU. To ensure a fair comparison, Monolithic PageRank was also performed on a graph where vertices were split by components. Results indicate that Levelwise PageRank is about as fast as Monolithic PageRank on the CPU, but quite a bit slower on the GPU. Slowdown on the GPU is likely caused by a large submission of small workloads, and expected to be non-issue when the computation is performed on massive graphs.
Adjusting primitives for graph : SHORT REPORT / NOTESSubhajit Sahu
Graph algorithms, like PageRank Compressed Sparse Row (CSR) is an adjacency-list based graph representation that is
Multiply with different modes (map)
1. Performance of sequential execution based vs OpenMP based vector multiply.
2. Comparing various launch configs for CUDA based vector multiply.
Sum with different storage types (reduce)
1. Performance of vector element sum using float vs bfloat16 as the storage type.
Sum with different modes (reduce)
1. Performance of sequential execution based vs OpenMP based vector element sum.
2. Performance of memcpy vs in-place based CUDA based vector element sum.
3. Comparing various launch configs for CUDA based vector element sum (memcpy).
4. Comparing various launch configs for CUDA based vector element sum (in-place).
Sum with in-place strategies of CUDA mode (reduce)
1. Comparing various launch configs for CUDA based vector element sum (in-place).
5. Contributions
• Investigate compositional properties of metaphorical
language
– Make word and phrase vectors
– Compare the phrase vector and those of component words
• Investigate role of visual information
– Learn visual representation of words and phrases
– Experiment with different multimodal fusion strategies
– Investigate whether visual features improve performance
Black Holes and White Rabbits: Metaphor Identification with Visual Features
6. Linguistic representations
• Skip-gram (Mikolov et al, 2013)
• 100 dimensional word and phrase embedding
from Wikipedia
– First learn word embedding [first pass]
– Identify verb-object, subject-verb and adjective-
noun phrases on corpus
– Rerun skip-gram to to learn phrase embedding
[second pass with context vector from before]
Black Holes and White Rabbits: Metaphor Identification with Visual Features
12. Comparison with other methods
Models F-Score
[Verb-noun]
F-Score
[Adjective-noun]
MIXLATE 0.75 0.79
Tsvetkov et al.
(2014)
0.85 Concreteness
features and hand
coded domain
information
Turney (2011) 0.68 0.79
[Accuracy,
evaluated only on
10 adjectives]
Hand annotated
abstractness scores
for words
Black Holes and White Rabbits: Metaphor Identification with Visual Features
Unlike supervised methods do not need large training data set to learn
the threshold
13. Conclusion
• Visual features help in metaphor identification
• Visual features are useful for modelling
compositionality
• Late fusion combining different scores perform
best.
• High performance with little annotated training
data.
• Visual features perform better for adjectives than
verbs: use video
Black Holes and White Rabbits: Metaphor Identification with Visual Features