Jean-Baptiste Tristan

Orcid: 0000-0003-2574-7883

Affiliations:
  • Amazon Web Services, USA
  • Oracle Labs, Burlington, MA, USA (former)
  • Harvard University, Cambridge, MA, USA (former)
  • INRIA Paris-Rocquencourt, Le Chesnay, France (former)
  • Paris Diderot University, France (PhD 2009)


According to our database1, Jean-Baptiste Tristan authored at least 32 papers between 2008 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Randomised Testing of the Compiler for a Verification-Aware Programming Language.
Proceedings of the IEEE Conference on Software Testing, Verification and Validation, 2024

2023
Verified Density Compilation for a Probabilistic Programming Language.
Proc. ACM Program. Lang., 2023

2022
Computable PAC Learning of Continuous Features.
Proceedings of the LICS '22: 37th Annual ACM/IEEE Symposium on Logic in Computer Science, Haifa, Israel, August 2, 2022

2021
On computable learning of continuous features.
CoRR, 2021

Online Post-Processing in Rankings for Fair Utility Maximization.
Proceedings of the WSDM '21, 2021

Conjugate Energy-Based Models.
Proceedings of the 38th International Conference on Machine Learning, 2021

A formal proof of PAC learnability for decision stumps.
Proceedings of the CPP '21: 10th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2021

Rate-Regularization and Generalization in Variational Autoencoders.
Proceedings of the 24th International Conference on Artificial Intelligence and Statistics, 2021

2020
Detecting and Exorcising Statistical Demons from Language Models with Anti-Models of Negative Data.
CoRR, 2020

Verification of ML Systems via Reparameterization.
CoRR, 2020

2019
Using Butterfly-patterned Partial Sums to Draw from Discrete Distributions.
ACM Trans. Parallel Comput., 2019

A Formal Proof of PAC Learnability for Decision Stumps.
CoRR, 2019

Unlocking Fairness: a Trade-off Revisited.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Scaling Hierarchical Coreference with Homomorphic Compression.
Proceedings of the 1st Conference on Automated Knowledge Base Construction, 2019

Sketching for Latent Dirichlet-Categorical Models.
Proceedings of the 22nd International Conference on Artificial Intelligence and Statistics, 2019

Gradient-Based Inference for Networks with Output Constraints.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2017
Adding Approximate Counters.
ACM Trans. Parallel Comput., 2017

Enforcing Constraints on Outputs with Unconstrained Inference.
CoRR, 2017

Compiling Markov chain Monte Carlo algorithms for probabilistic modeling.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

Enforcing Output Constraints via SGD: A Step Towards Neural Lagrangian Relaxation.
Proceedings of the 6th Workshop on Automated Knowledge Base Construction, 2017

2016
Exponential Stochastic Cellular Automata for Massively Parallel Inference.
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics, 2016

2015
Using Butterfly-Patterned Partial Sums to Optimize GPU Memory Accesses for Drawing from Discrete Distributions.
CoRR, 2015

Efficient Training of LDA on a GPU by Mean-for-Mode Estimation.
Proceedings of the 32nd International Conference on Machine Learning, 2015

2014
Augur: Data-Parallel Probabilistic Modeling.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

2013
Augur: a Modeling Language for Data-Parallel Probabilistic Inference.
CoRR, 2013

Parallel programming with big operators.
Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2013

2012
RockSalt: better, faster, stronger SFI for the x86.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2012

2011
Evaluating value-graph translation validation for LLVM.
Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation, 2011

2010
A simple, verified validator for software pipelining.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

2009
Formal verification of translation validators.
PhD thesis, 2009

Verified validation of lazy code motion.
Proceedings of the 2009 ACM SIGPLAN Conference on Programming Language Design and Implementation, 2009

2008
Formal verification of translation validators: a case study on instruction scheduling optimizations.
Proceedings of the 35th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2008


  Loading...