ArXivCSExplorer
☆☆Bookmarks🏆RSSHow to UseFAQ
Built with and by Teycir Ben Soltane•
How to Use•FAQ•GitHub•arXiv.org•
Share:

20 results for “Familiarity with copula theory”

CS papers only

Hybrid search: Keyword + semantic, ranked by combined score.ⓘ

Want pure semantic search? Try claim verification →

cs.LGcs.AIcs.ITEmpiricalRecentJul 3, 2026

Towards Diverse and Comprehensive Benchmarks for Mutual Information Estimation

Alberto Foresti, Ivan Butakov, Alexander Tolmachev, Giulio Franzese +2 more

This paper proposes a comprehensive benchmarking framework for evaluating mutual information estimation methods on complex, realistic data using copula theory.

View →
stat.MLcs.AIcs.LGRecentMay 28, 2026

Reward Learning from Best-of-$N$ Preference Data: Targets, Tradeoffs, and Design Principles

Rattana Pukdee, Maria-Florina Balcan, Pradeep Ravikumar

This paper analyzes Best-of-$N$ preference data, deriving explicit reward targets for independent-reference variants and establishing design principles for choosing $N$ and the base distribution to op…

View →
cs.LGcs.AIRecentMay 28, 2026

Score Broadcast and Decorrelation: A General Framework for Broadcast-Based Credit Assignment

Mustafa Uzun, Mete Erdogan, Cengiz Pehlevan, Alper T. Erdogan

The paper introduces Score Broadcast and Decorrelation (SBD), a general theoretical framework that unifies broadcast-based credit assignment across various differentiable loss functions by leveraging…

View →
stat.MLcs.AIcs.LGTheoreticalRecentJul 18, 2026

A Causal Markov Condition for Value

Olav Benjamin Vassend

This paper introduces the Value Causal Markov Condition (v-CMC) for linking causality and utility, and develops its foundations.

View →
cs.LGcs.AIRecentMay 29, 2026

From Rashomon Theory to PRAXIS: Efficient Decision Tree Rashomon Sets

Zakk Heile, Hayden McTavish, Varun Babbar, Margo Seltzer +1 more

The paper introduces PRAXIS, a novel algorithm that efficiently approximates the computation of 'Rashomon sets' for decision trees, significantly reducing memory and runtime complexity.

View →
stat.MLcs.LGq-fin.PMTheoreticalRecentJun 25, 2026

The Decision Geometry of Covariance Estimation for the Global Minimum-Variance Portfolio under Heavy Tails

Xavier Fonseca

This paper characterizes how estimation error in covariance matrices affects the global minimum-variance portfolio and derives a decision geometry for regret.

View →
q-fin.MFcs.CEcs.ITTheoreticalRecentJul 24, 2026

Neilson's Weak vs. Strong Loss Aversion: A Characterization and a Generalized CPT-Utility Function

Symeon Vaidanis, Marios Kountouris

This paper provides a theoretical analysis of Cumulative Prospect Theory (CPT) for multi-objective and multi-criteria decision-making under risk, focusing on Neilson's definitions of aversion and prop…

View →
cs.ITcs.GTTheoreticalRecentJun 12, 2026

The Algebraic Limits of Polynomial Information Measures

Yuqing Kong

This paper studies the existence of polynomial measures of dependence between two random variables that satisfy the data processing inequality and vanish on independence. It proves that no such polyno…

View →
cs.AIRecentMay 29, 2026

Evaluating Bivariate Causal Statements Based on Mutual Compatibility

Erik Jahn, Dominik Janzing

The paper introduces novel compatibility and incompatibility scores to evaluate collections of bivariate causal statements, providing a way to assess causal claims when ground truth is unavailable.

View →
cs.LOcs.CCRecentMay 29, 2026

Aspects of Coherence in Dependence Logic

Timon Barlag, Nicolas Fröhlich, Miika Hannula, Phokion G. Kolaitis +3 more

The paper establishes that for quantifier-free dependence logic formulas, the property of k-coherence is equivalent to first-order rewritability, and analyzes the computational complexity of checking…

View →
stat.MLcs.LGmath.STTheoreticalRecentJun 26, 2026

Surprises in Proper Positive-Only Learning

Shai Ben-David, Farnam Mansouri, Anay Mehrotra, Manolis Zampetakis

This paper characterizes proper binary classification from positive-only samples, revealing a rich landscape that differs from standard PAC learning.

View →
stat.MLcs.LGstat.MEEmpiricalRecentJul 26, 2026

Distributional Split Criteria for Random Forests: Extensions, Shrinkage, and the Robustness of Mean Splitting

Silas Koemen

This paper introduces Distributional Random Forests, which replace mean-based CART splitting with criteria that compare full conditional response distributions in candidate children. The authors syste…

View →
cs.AIRecentMay 29, 2026

Formalizing and falsifying causal pathways of rare events

Anahita Haghighat, Dominik Janzing

The paper formalizes the concept of a causal pathway for rare events, showing that testable implications can be derived solely from this pathway abstraction, simplifying complex causal modeling.

View →