output
20152025
most citedFeature relevance quantification in explainable AI: A causal problem

156 citations

researchers with a paper here
collaborating institutions
Showing 2025Show all

3 papers · 1 filter

cs.CV2025★ 2 cited

Leveraging Cycle-Consistent Anchor Points for Self-Supervised RGB-D Registration

Siddharth Tourani, Jayaram Reddy, Sarvesh Thakur +3

With the rise in consumer depth cameras, a wealth of unlabeled RGB-D data has become available. This prompts the question of how to utilize this data for geometric reasoning of sce…

cs.LG2025

A Universal Banach--Bregman Framework for Stochastic Iterations: Unifying Stochastic Mirror Descent, Learning and LLM Training

Johnny R. Zhang, Xiaomei Mi, Gaoyuan Du +4

Stochastic optimization powers the scalability of modern artificial intelligence, spanning machine learning, deep learning, reinforcement learning, and large language model trainin…

cs.DS2025

A Bad Example for Jain's Iterative Rounding Theorem for the Cover Small Cuts Problem

Miles Simmons, Ishan Bansal, Joe Cheriyan

Jain's iterative rounding theorem is a well-known result in the area of approximation algorithms and, more broadly, in combinatorial optimization. The theorem asserts that LP relax…