arXiv:2606. 07599v1 Announce Type: cross Abstract: Ordinal Regression (OR) aims to predict target values with inherent order, underpinning critical applications across diverse domains, from recommender systems to computer vision.
The paper introduces T23D-CompBench, a new benchmark for fine‑grained text‑to‑3D quality assessment that includes 3,600 textured meshes generated from ten state‑of‑the‑art models and 129,600 human ratings. It also proposes Rank2Score, a two‑stage rank‑learning metric that first trains with supervised contrastive regression and curriculum learning, then refines predictions using mean opinion scores to better align with human judgments. Experiments show Rank2Score outperforms existing metrics and can be used as a reward function for generative model optimization.
CORE improves compositional reasoning in multimodal language models by distilling a cross‑attentive reranker’s fine‑grained judgments into the embedding model. It generates candidate lists across five compositional matching levels and trains with a Rank‑KL objective to replicate the reranker’s ranking. Experiments on COLA, SUGARCREPE++, and NEGBENCH show CORE‑RERANKER‑8B outperforms Jina‑Reranker by 10.7 points, while CORE‑EMBED‑8B achieves the best overall average among evaluated embeddings, with gains also transferring to the MCMR benchmark without harming COCO or Flickr30K retrieval.
Understanding both expressed and evoked emotions is critical for multimodal large language models (MLLMs) to achieve comprehensive affect-aware interactions. However, existing benchmarks typically examine expressed and evoked emotions in isolation or are constrained to coarse-grained and incomplete affective characterizations.
arXiv:2606. 01269v1 Announce Type: new Abstract: Transitive inference is the challenge of inferring that A < C from knowing only adjacent relations (A < B, B < C).
arXiv:2608. 15224v1 Announce Type: new Abstract: Reliable post-hoc evaluation asks whether already generated text satisfies a target criterion after generation.
The paper introduces a compositional graph embedding framework based on Aitchison geometry, where nodes are represented as simplex-valued mixtures over latent archetypal factors. By embedding these mixtures using isometric log-ratio coordinates, the method preserves Aitchison distances while allowing unconstrained optimization in Euclidean space, yielding intrinsically interpretable embeddings. The approach achieves competitive performance on node classification and link prediction tasks and enables principled component restriction through subcompositional coherence, allowing analysis of how archetype groups influence representations and predictions.
arXiv:2608. 10857v1 Announce Type: new Abstract: Determining the complexity, or Intrinsic Dimension (ID), of data is fundamental to efficient and interpretable representation learning.
arXiv:2509. 22888v2 Announce Type: replace Abstract: Standard LLM evaluation practices compress diverse abilities into single scores, obscuring their inherently multidimensional nature.
arXiv:2607. 06402v1 Announce Type: cross Abstract: Images tell us what a scene looks like, but rarely what it would feel like to be there.
The paper introduces the Rashomon set for dimension reduction, a collection of equally good embeddings that preserve high‑dimensional structure. It proposes PCA‑informed alignment to make axes interpretable, concept‑alignment regularization to incorporate external knowledge, and a method to extract trustworthy nearest‑neighbor relationships across the Rashomon set for refined embeddings. These techniques aim to produce interpretable, robust, and goal‑aligned visualizations by leveraging multiple valid embeddings instead of a single one.
arXiv:2607. 23575v1 Announce Type: cross Abstract: Ordinal regression is widely used in scenarios where labels are discrete yet inherently ordered.