| Publication | Date of Publication | Type |
|---|
Superquantile-Gibbs Relaxation for Minima-selection in Bilevel Optimization
(available as arXiv preprint) | 2026-01-01 | Paper |
Sharp First-Order Lower Bounds under α-Polyak-Lojasiewicz Conditions
(available as arXiv preprint) | 2026-01-01 | Paper |
Recursive causal discovery
Journal of Machine Learning Research (JMLR) | 2025-05-16 | Paper |
Causal Effect Identification in Heterogeneous Environments from Higher-Order Moments
(available as arXiv preprint) | 2025-01-01 | Paper |
| Sharp Analysis of Stochastic Optimization under Global Kurdyka-{\L}ojasiewicz Inequality | 2022-10-04 | Paper |
Asymptotic analysis for multi-objective sequential stochastic assignment problems
Stochastics | 2022-07-05 | Paper |
Sharp Analysis of Stochastic Optimization under Global Kurdyka-Łojasiewicz Inequality
(available as arXiv preprint) | 2022-01-01 | Paper |
| Estimating the directed information to infer causal relationships in ensemble neural spike train recordings | 2020-11-17 | Paper |
Learning linear non-Gaussian causal models in the presence of latent variables
(available as arXiv preprint) | 2020-10-05 | Paper |
| Learning linear non-Gaussian causal models in the presence of latent variables | 2020-10-05 | Paper |
Learning minimal latent directed information polytrees
Neural Computation | 2019-06-05 | Paper |
Designing Router Scheduling Policies: A Privacy Perspective
IEEE Transactions on Signal Processing | 2018-07-18 | Paper |
| Counting and Sampling from Markov Equivalent DAGs Using Clique Trees | 2018-02-04 | Paper |
Counting and Sampling from Markov Equivalent DAGs Using Clique Trees
(available as arXiv preprint) | 2018-01-01 | Paper |
Fingerprinting With Equiangular Tight Frames
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Nonasymptotic Upper Bounds for Deletion Correcting Codes
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
An Improvement to Levenshtein's Upper Bound on the Cardinality of Deletion Correcting Codes
IEEE Transactions on Information Theory | 2017-05-16 | Paper |
Restricted Composition Deletion Correcting Codes
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Generalized Sphere-Packing Bounds on the Size of Codes for Combinatorial Channels
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Directed Information Graphs
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
Delay-Privacy Tradeoff in the Design of Scheduling Policies
IEEE Transactions on Information Theory | 2017-04-28 | Paper |
On the Varshamov-Tenengolts construction on binary strings
Discrete Mathematics | 2014-01-17 | Paper |
| Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings | 2012-11-16 | Paper |
Two Approaches to the Construction of Deletion Correcting Codes: Weight Partitioning and Optimal Colorings
(available as arXiv preprint) | 2012-01-01 | Paper |
| The vector decomposition problem for elliptic and hyperelliptic curves | 2007-01-03 | Paper |
