Skip To Main Content
Iden Kalemaj on Muck Rack

Iden Kalemaj

As seen in: Wiley Online Library, arXiv, Amazon Science
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work. Claim your profile

Get in touch with Iden

Contact Iden, search articles and posts on X, monitor coverage, and track replies from one place.

Learn more about Muck Rack

Actions

Share this page

Is this you?

As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile

Articles

Differentially private conditional independence testing

|
By Iden Kalemaj, Shiva Prasad Kasiviswanathan, Aaditya Ramdas
| Amazon Science
Conditional independence (CI) tests are widely used in statistical data analysis, e.g., they are the building block of many algorithms for causal graph discovery. The goal of a CI test is to accept or reject the null hypothesis that X ⊥⊥ Y | Z, where X ∈ R, Y ∈ R, Z ∈ Rd. In this work, we investigate conditional independence testing under the constraint of differential privacy.
Open in Who Shared Issue with article?

Computer Science > Cryptography and Security

|
By Jason Gantenberg, Iden Kalemaj, Debanuj Nayak
| arXiv
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website. Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them. Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Open in Who Shared View Duplicates (241) Issue with article?

Isoperimetric inequalities for real‐valued functions with applications to monotonicity testing

|
By Hadley Black, Iden Kalemaj, Sofya Raskhodnikova
| Wiley Online Library Verified
We generalize the celebrated isoperimetric inequality of Khot, Minzer, and Safra (SICOMP 2018) for Boolean functions to the case of real-valued functions . Our main tool in the proof of the generalized inequality is a new Boolean decomposition that represents every real-valued function over an arbitrary partially ordered domain as a collection of Boolean functions over the same domain, roughly capturing the distance of to monotonicity and the structure of violations of to monotonicity.
Open in Who Shared Issue with article?
See all 5 articles