Skip to content

Commit 62e18a8

Browse files
committed
fix citations
1 parent 9e3128b commit 62e18a8

2 files changed

Lines changed: 26 additions & 4 deletions

File tree

paper.bib

Lines changed: 25 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -1,9 +1,15 @@
11
@software{jax2018github,
2-
author = {James Bradbury and Roy Frostig and Peter Hawkins and Matthew James Johnson and Chris Leary and Dougal Maclaurin and George Necula and Adam Paszke and Jake Vander{P}las and Skye Wanderman-{M}ilne and Qiao Zhang},
2+
3+
author = {James Bradbury and Roy Frostig and Peter Hawkins and Matthew James Johnson and Yash Katariya and Chris Leary and Dougal Maclaurin and George Necula and Adam Paszke and Jake Vander{P}las and Skye Wanderman-{M}ilne and Qiao Zhang},
4+
35
title = {{JAX}: composable transformations of {P}ython+{N}um{P}y programs},
6+
47
url = {http://github.com/jax-ml/jax},
8+
59
version = {0.3.13},
6-
year = {2018}
10+
11+
year = {2018},
12+
713
}
814

915
@software{flax2020github,
@@ -86,14 +92,30 @@ @article{silva2020optimization
8692
organization = {PMLR}
8793
}
8894

95+
@inproceedings{panda2024vanilla,
96+
author = {Subrat Prasad Panda and
97+
Blaise Genest and
98+
Arvind Easwaran and
99+
Ponnuthurai Nagaratnam Suganthan},
100+
title = {Vanilla Gradient Descent for Oblique Decision Trees},
101+
booktitle = {{ECAI} 2024 - 27th European Conference on Artificial Intelligence},
102+
series = {Frontiers in Artificial Intelligence and Applications},
103+
volume = {392},
104+
pages = {1140--1147},
105+
year = {2024},
106+
url = {https://doi.org/10.3233/FAIA240607},
107+
doi = {10.3233/FAIA240607},
108+
}
109+
89110
@article{topin2021iterative,
90111
title = {Iterative Bounding {MDP}s: Learning Interpretable Policies via Non-Interpretable Methods},
91112
author = {Nicholay Topin and Stephanie Milani and Fei Fang and Manuela Veloso},
92113
journal = {Proceedings of the AAAI Conference on Artificial Intelligence},
93114
volume = {35},
94115
number = {11},
95116
pages = {9923--9931},
96-
year = {2021}
117+
year = {2021},
118+
doi = {10.1609/aaai.v35i11.17192}
97119
}
98120

99121
@article{landajuela2021discovering,

paper.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -24,7 +24,7 @@ bibliography: paper.bib
2424
# Summary
2525

2626
BordAX is a Python framework for reinforcement learning (RL) built on JAX [@jax2018github].
27-
It provides a modular, fully JIT-compilable training pipeline that supports multiple policy representations, including standard multilayer perceptrons (MLPs), differentiable decision trees (DTSemNet), and boolean function networks (HyperBool).
27+
It provides a modular, fully JIT-compilable training pipeline that supports multiple policy representations, including standard multilayer perceptrons (MLPs), differentiable decision trees (DTSemNet, [@panda2024vanilla]), and boolean function networks (HyperBool).
2828
BordAX currently implements Proximal Policy Optimization (PPO) [@schulman2017proximal] and Deep Q-Networks (DQN) [@mnih2015human], and is designed so that additional algorithms can be composed from interchangeable collector, batch-builder, and updater components.
2929
The framework supports both Gymnax [@gymnax2022github] environments, which enable full JIT compilation of the training loop via `jax.lax.scan`, and standard Gymnasium [@towers2026gymnasium] environments.
3030
On a CartPole-v1 benchmark with identical hyperparameters, BordAX with Gymnax achieves approximately 2.8 times higher throughput than Stable-Baselines3 [@raffin2021stable].

0 commit comments

Comments
 (0)