Searcharxiv⌕ Search

arXiv subjects

José Carrasquel

Publications and source records attributed to José Carrasquel.

6 recordsLinked to original sources

NASimJax: A GPU-Accelerated Policy Learning Framework for Penetration Testing

Penetration testing - the practice of simulating cyberattacks to identify vulnerabilities - is a complex sequential decision-making task that is inherently partially observable and features large action spaces. Existing RL simulators for this domain are CPU-bound and fixed to narrow scenarios, making it infeasible to train policies that generalize across networks. We present NASimJax, a JAX-native framework that formulates penetration testing as a Contextual POMDP and introduces a network generation pipeline producing structurally diverse, guaranteed-solvable scenarios. The framework reaches up to 80$\times$ higher environment throughput than previous simulators, enabling experiments on larger networks and tractable hyperparameter searches. We provide PPO and PQN baselines and conduct the first systematic evaluation of unsupervised environment design for penetration testing. We find that Prioritized Level Replay and ACCEL handle dense training distributions better than Domain Randomization, and that training on sparser topologies yields an implicit curriculum that improves generalization - even to topologies denser than those seen during training. A recurrent PPO variant confirms that these distributional findings are not an artifact of feed-forward policies. The code is available at: https://github.com/raphsimon/NASimJax.

cs.LG↗

Sectional category à la Quillen

In this note we give a characterization of the sectional category of a map between rational spaces in terms of its Koszul-Quillen model.

math.AT↗

Explicit Quillen models for Cartesian products of $2$-cones

We give an explicit minimal Quillen model for the Cartesian product $X\times Y$ of rational $2$-cones in terms of derivations and a binary operation $\star \colon \mathbb{M}(V)\otimes \mathbb{L}(W)\to \mathbb{L}(V\oplus W\oplus s(V\otimes W))$, where $(\mathbb{L}(V), \partial)$ and $(\mathbb{L}(W), \partial)$ are Quillen minimal models for $X$ and $Y$ respectively and $\mathbb{M}$ denotes the free magma on $W$. The model presented also allows us to explicitly describe a model for the diagonal map $Δ\colon X\to X\times X$.

math.AT↗

On the sectional category of subgroup inclusions and Adamson cohomology theory

The sectional category of a subgroup inclusion $H \hookrightarrow G$ can be defined as the sectional category of the corresponding map between Eilenberg--MacLane spaces. We extend a characterization of topological complexity of aspherical spaces given by Farber, Grant, Lupton and Oprea to the context of sectional category of subgroup inclusions and investigate it by means of Adamson cohomology theory.

math.AT↗

Topological complexity and efficiency of motion planning algorithms

We introduce a variant of Farber's topological complexity, defined for smooth compact orientable Riemannian manifolds, which takes into account only motion planners with the lowest possible "average length" of the output paths. We prove that it never differs from topological complexity by more than $1$, thus showing that the latter invariant addresses the problem of the existence of motion planners which are "efficient".

math.AT↗