Vineet Nair

Orcid: 0000-0001-9542-038X

According to our database1, Vineet Nair authored at least 22 papers between 2014 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Maximally Useful and Minimally Redundant: The Key to Self Supervised Learning for Imbalanced Data.
CoRR, September, 2025

Proving CPU Executions in Small Space.
IACR Cryptol. ePrint Arch., 2025

2024
BrakingBase - a linear prover, poly-logarithmic verifier, field agnostic polynomial commitment scheme.
IACR Cryptol. ePrint Arch., 2024

Dual Polynomial Commitment Schemes and Applications to Commit-and-Prove SNARKs.
Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security, 2024

2023
Mitigating Disparity while Maximizing Reward: Tight Anytime Guarantee for Improving Bandits.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

Robust Planning over Restless Groups: Engagement Interventions for a Large-Scale Maternal Telehealth Program.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
A causal bandit approach to learning good atomic interventions in presence of unobserved confounders.
Proceedings of the Uncertainty in Artificial Intelligence, 2022

ADVISER: AI-Driven Vaccination Intervention Optimiser for Increasing Vaccine Uptake in Nigeria.
Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Strategic Representation.
Proceedings of the International Conference on Machine Learning, 2022

Long-Term Resource Allocation Fairness in Average Markov Decision Process (AMDP) Environment.
Proceedings of the 21st International Conference on Autonomous Agents and Multiagent Systems, 2022

2021
Causal Bandits on General Graphs.
CoRR, 2021

State-Visitation Fairness in Average-Reward MDPs.
CoRR, 2021

Sparse linear networks with a fixed butterfly structure: theory and practice.
Proceedings of the Thirty-Seventh Conference on Uncertainty in Artificial Intelligence, 2021

Strategic Classification in the Dark.
Proceedings of the 38th International Conference on Machine Learning, 2021

Budgeted and Non-Budgeted Causal Bandits.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Randomized Polynomial-Time Equivalence Between Determinant and Trace-IMM Equivalence Tests.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Achieving Fairness in the Stochastic Multi-Armed Bandit Problem.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Average-case linear matrix factorization and reconstruction of low width algebraic branching programs.
Comput. Complex., 2019

99DOTS: a low-cost approach to monitoring and improving medication adherence.
Proceedings of the Tenth International Conference on Information and Communication Technologies and Development, 2019

2017
Reconstruction of Full Rank Algebraic Branching Programs.
Proceedings of the 32nd Computational Complexity Conference, 2017

2016
Separation Between Read-once Oblivious Algebraic Branching Programs (ROABPs) and Multilinear Depth Three Circuits.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2014
An explicit sparse recovery scheme in the L1-norm.
CoRR, 2014


  Loading...