paper-with-me

홈 › Papers

Text-Based Ideal Points

2020-05-08 · ACL 2020 6 · Keyon Vafa, Suresh Naidu, David M. Blei

Ideal point models analyze lawmakers' votes to quantify their political positions, or ideal points. But votes are not the only way to express a political position. Lawmakers also give speeches, release press statements, and post tweets. In this paper, we introduce the text-based ideal point model (TBIP), an unsupervised probabilistic topic model that analyzes texts to quantify the political positions of its authors. We demonstrate the TBIP with two types of politicized text data: U.S. Senate speeches and senator tweets. Though the model does not analyze their votes or political affiliations, the TBIP separates lawmakers by party, learns interpretable politicized topics, and infers ideal points close to the classical vote-based ideal points. One benefit of analyzing texts, as opposed to votes, is that the TBIP can estimate ideal points of anyone who authors political texts, including non-voting actors. To this end, we use it to study tweets from the 2020 Democratic presidential candidates. Using only the texts of their tweets, it identifies them along an interpretable progressive-to-moderate spectrum.

📄 PDF Abstract BibTeX arXiv:2005.04232

Code (1)

keyonvafa/tbip 공식 구현 tf

Similar Papers 제목 키워드 기반

Approximate Vanishing Ideal via Data Knotting

2018-01-29 · Hiroshi Kera, Yoshihiko Hasegawa

The vanishing ideal is a set of polynomials that takes zero value on the given data points. Originally proposed in computer algebra, the vanishing ideal has been recently exploited for extracting the nonlinear structures…

ClassificationGeneral Classification

Conditional Gradients for the Approximately Vanishing Ideal

2022-02-07 · Elias Wirth, Sebastian Pokutta

The vanishing ideal of a set of points $X\subseteq \mathbb{R}^n$ is the set of polynomials that evaluate to $0$ over all points $\mathbf{x} \in X$ and admits an efficient representation by a finite set of polynomials cal…

Curriculum Learning by Transfer Learning: Theory and Experiments with Deep Networks

2018-02-11 · ICML 2018 7 · Daphna Weinshall, Gad Cohen, Dan Amir

We provide theoretical investigation of curriculum learning in the context of stochastic gradient descent when optimizing the convex linear regression loss. We prove that the rate of convergence of an ideal curriculum le…

Learning TheoryTransfer Learning

Learning with Cross-Kernels and Ideal PCA

2014-06-10 · Franz J. Király, Martin Kreuzer, Louis Theran

We describe how cross-kernel matrices, that is, kernel matrices between the data and a custom chosen set of `feature spanning points' can be used for learning. The main potential of cross-kernels lies in the fact that (a…

Simultaneous Preference and Metric Learning from Paired Comparisons

2020-09-04 · NeurIPS 2020 12 · Austin Xu, Mark A. Davenport

A popular model of preference in the context of recommendation systems is the so-called \emph{ideal point} model. In this model, a user is represented as a vector $\mathbf{u}$ together with a collection of items $\mathbf…

Metric LearningRecommendation Systems