Michal Moshkovitz

According to our database1, Michal Moshkovitz authored at least 27 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
An Axiomatic Approach to Model-Agnostic Concept Explanations.
CoRR, 2024

Principal-Agent Reward Shaping in MDPs.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Finding Safe Zones of Markov Decision Processes Policies.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

Online k-means Clustering on Arbitrary Data Streams.
Proceedings of the International Conference on Algorithmic Learning Theory, 2023

2022
A Learning-Theoretic Framework for Certified Auditing of Machine Learning Models.
CoRR, 2022

There is no Accuracy-Interpretability Tradeoff in Reinforcement Learning for Mazes.
CoRR, 2022

Finding Safe Zones of policies Markov Decision Processes.
CoRR, 2022

Framework for Evaluating Faithfulness of Local Explanations.
Proceedings of the International Conference on Machine Learning, 2022

2021
A Constant Approximation Algorithm for Sequential No-Substitution k-Median Clustering under a Random Arrival Order.
CoRR, 2021

A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Connecting Interpretability and Robustness in Decision Trees through Separation.
Proceedings of the 38th International Conference on Machine Learning, 2021

Bounded Memory Active Learning through Enriched Queries.
Proceedings of the Conference on Learning Theory, 2021

Unexpected Effects of Online no-Substitution k-means Clustering.
Proceedings of the Algorithmic Learning Theory, 2021

No-substitution k-means Clustering with Adversarial Order.
Proceedings of the Algorithmic Learning Theory, 2021

2020
ExKMC: Expanding Explainable k-Means Clustering.
CoRR, 2020

Towards a Combinatorial Characterization of Bounded-Memory Learning.
Proceedings of the Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020, 2020

Explainable k-Means and k-Medians Clustering.
Proceedings of the 37th International Conference on Machine Learning, 2020

2019
Unexpected Effects of Online K-means Clustering.
CoRR, 2019

Novel Uncertainty Framework for Deep Learning Ensembles.
CoRR, 2019

2018
Entropy Samplers and Strong Generic Lower Bounds For Space Bounded Learning.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Mixing Implies Strong Lower Bounds for Space Bounded Learning.
Electron. Colloquium Comput. Complex., 2017

Mixing Implies Lower Bounds for Space Bounded Learning.
Electron. Colloquium Comput. Complex., 2017

A General Memory-Bounded Learning Algorithm.
CoRR, 2017

Mixing Complexity and its Applications to Neural Networks.
CoRR, 2017

2016
Principled Option Learning in Markov Decision Processes.
CoRR, 2016

2014
Control your information for better predictions.
Proceedings of the 2014 IEEE International Symposium on Information Theory, Honolulu, HI, USA, June 29, 2014

2010
Distance Estimators with Sublogarithmic Number of Queries.
Electron. Colloquium Comput. Complex., 2010


  Loading...