atlas

Research map / Learning theory and algorithms / Matrix and tensor methods

Properties of Position Matrices and Their Elections

AAAI 2023 · Learning theory and algorithms › Matrix and tensor methods · approach: Matrix completion and factorization · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use position matrices closer to UN rather than IDElections realizing the same position matrix · 8x80 datasetmaximum isomorphic swap distance: larger than 20% of the maximum possible isomorphic swap distanceMixed
Use position matrices closer to UN rather than IDElections realizing the same position matrix · 4x16 datasetmaximum isomorphic swap distance: around 50% of the maximum achievable distanceHelped
Provide an explicit description of the vote domainFrequency-matrix realizability testing · Explicit, single-peaked, and group-separable domainsalgorithmic complexityHelped
Allow an explicitly listed subset of votes rather than the full balanced group-separable domainPosition-matrix realizability testing · Explicit vote subsetsalgorithmic complexityHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy