Search Results for author: Suhas Vijaykumar

Found 8 papers, 1 papers with code

DoubleMLDeep: Estimation of Causal Effects with Multimodal Data

no code implementations1 Feb 2024 Sven Klaassen, Jan Teichert-Kluge, Philipp Bach, Victor Chernozhukov, Martin Spindler, Suhas Vijaykumar

This paper explores the use of unstructured, multimodal data, namely text and images, in causal inference and treatment effect estimation.

Causal Inference Marketing

Synthetic Combinations: A Causal Inference Framework for Combinatorial Interventions

1 code implementation NeurIPS 2023 Abhineet Agarwal, Anish Agarwal, Suhas Vijaykumar

Our goal is to learn unit-specific potential outcomes for any combination of these $p$ interventions, i. e., $N \times 2^p$ causal parameters.

Causal Inference Experimental Design

Kernel Ridge Regression Inference

no code implementations13 Feb 2023 Rahul Singh, Suhas Vijaykumar

We provide uniform inference and confidence bands for kernel ridge regression (KRR), a widely-used non-parametric regression estimator for general data types including rankings, images, and graphs.

regression valid

Frank Wolfe Meets Metric Entropy

no code implementations17 May 2022 Suhas Vijaykumar

The Frank-Wolfe algorithm has seen a resurgence in popularity due to its ability to efficiently solve constrained optimization problems in machine learning and high-dimensional statistics.

Classification as Direction Recovery: Improved Guarantees via Scale Invariance

no code implementations17 May 2022 Suhas Vijaykumar, Claire Lazar Reich

Modern algorithms for binary classification rely on an intermediate regression problem for computational tractability.

Binary Classification Classification +1

Stability and Efficiency of Random Serial Dictatorship

no code implementations13 Oct 2021 Suhas Vijaykumar

This paper establishes non-asymptotic convergence of the cutoffs in Random serial dictatorship in an environment with many students, many schools, and arbitrary student preferences.

Localization, Convexity, and Star Aggregation

no code implementations NeurIPS 2021 Suhas Vijaykumar

Offset Rademacher complexities have been shown to provide tight upper bounds for the square loss in a broad class of problems including improper statistical learning and online learning.

A Possibility in Algorithmic Fairness: Can Calibration and Equal Error Rates Be Reconciled?

no code implementations18 Feb 2020 Claire Lazar Reich, Suhas Vijaykumar

Decision makers increasingly rely on algorithmic risk scores to determine access to binary treatments including bail, loans, and medical interventions.

Fairness

Cannot find the paper you are looking for? You can Submit a new open access paper.