Dual-Node NVIDIA DGX Spark over Tailscale: A Remote-Access Testbed for Distributed LLM Training and Cyber-Threat-Intelligence Fine-Tuning
- URL: http://arxiv.org/abs/2608.07226v1
- Date: Fri, 07 Aug 2026 13:41:57 GMT
- Title: Dual-Node NVIDIA DGX Spark over Tailscale: A Remote-Access Testbed for Distributed LLM Training and Cyber-Threat-Intelligence Fine-Tuning
- Abstract summary: This report presents a proof-of-concept deployment of distributed NanoChat pretraining across two NVIDIA DGX Spark systems.<n>The cluster supports a 400-level AI course (CS 426) and a query engine for Security+ POGIL activities in CBS 255.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Compact AI systems make local language-model experimentation increasingly accessible, yet practical evidence for multi-node training on desktop-class accelerators remains limited. This report presents a proof-of-concept deployment of distributed NanoChat pretraining across two NVIDIA DGX Spark systems, each with a GB10 Grace Blackwell system-on-chip and 128 GB of unified memory, administered remotely over a Tailscale mesh VPN and connected for training by a dedicated 200 Gb/s QSFP56 direct fiber link. PyTorch torchrun, DDP, and NCCL were configured with one process per node, a depth-20 NanoChat model, a local batch size of 32 per node, and a 2,048-token context, giving a global batch of 131,072 tokens per step. The run sustained a step time of about 69.4 s (about 1,890 tokens/s), processing about 653 million tokens over four days. We document link configuration, container setup, interface binding, a step-zero evaluation bug that triggered NCCL timeouts, checkpointing, and troubleshooting lessons, as a reproducibility reference for small labs. We also built a cybersecurity fine-tuning dataset from 77 CISA advisories (338 training, 37 validation conversations) and ran a 17-question held-out evaluation comparing a baseline SFT checkpoint against a CTI-augmented checkpoint with an Ollama-hosted LLM judge. CTI-specific categories improved while general-knowledge categories regressed, for a small overall change from 2.06 to 2.29 on a 0-10 scale. The same cluster supports a 400-level AI course (CS 426) and a query engine for CompTIA Security+ POGIL activities in CBS 255, showing modest local infrastructure can serve both research and teaching. The study establishes feasibility rather than a scaling-efficiency claim, since single-node throughput used for comparison was estimated, not measured under matched conditions. Runbook and scripts are available (see Code Availability).
Related papers
- Numbat: Building and Verifying a Self-Contained Machine-Learning Stack [0.0]
numbat is a machine-learning stack written in one general-purpose language (Zig) with no third-party dependencies.<n>We report on the construction and verification of numbat.
arXiv Detail & Related papers (2026-09-09T08:36:12Z) - CogEvol: Towards Efficient and Reliable Learning Environment Generation [49.18054685846454]
We present CogEvol, a family of models trained specifically for Learning Environment Generation.<n>CogEvol completes a slide in a median of 17 seconds and an interactive page in 59, replacing minutes-long multi-turn agent scaffolding.<n>A production-grounded data pipeline turns real failures into 53,687 verified SFT samples.
arXiv Detail & Related papers (2026-08-31T15:33:38Z) - Qwen-CUA: Native Computer Use for (almost) Everything [104.78368489343713]
We introduce Qwen-CUA, a native computer-use agent with a mixture-of-experts backbone.<n>It observes only screenshots and acts through keyboard and mouse events, without DOM trees, accessibility metadata, or task-specific APIs.<n>Its scaffold maintains up to 20 active screenshots and folds older visual history in fixed-size blocks to retain recent evidence.
arXiv Detail & Related papers (2026-08-03T15:04:20Z) - ProCUA-SFT Technical Report [80.97543110323542]
Training computer-use agents (CUAs) requires large-scale, diverse trajectory data collected in full desktop environments.<n>We present ProCUA-SFT, a dataset of 3.1M step-level SFT samples distilled from 93K synthetic trajectories.<n>Fine-tuning UI-TARS 7B on ProCUA-SFT for one epoch yields 45.0% on OSWorld -- an 18.7 percentage-point improvement over the base model.
arXiv Detail & Related papers (2026-06-15T22:04:11Z) - EEVEE: Towards Test-time Prompt Learning in the Real World for Self-Improving Agents [64.96332056338923]
EEVEE is the first multi-dataset test-time prompt learning framework for LLM agents.<n>It enables test-time prompt learning under real-world task streams.<n>EEVEE improves average multi-benchmark scores by 10.38 and 24.32 points over Qwen3-4B-Instruct and DeepSeek-V3.2.
arXiv Detail & Related papers (2026-06-09T17:57:16Z) - MobileGym: A Verifiable and Highly Parallel Simulation Platform for Mobile GUI Agent Research [39.68394140712043]
MobileGym is a lightweight, fully controllable environment for everyday mobile use.<n>A layered state model and a declarative task-definition framework keep state programmability and task creation practical at scale.<n>A single programmatic judging mechanism delivers both deterministic evaluation verdicts and dense rewards.
arXiv Detail & Related papers (2026-05-25T17:59:49Z) - LIDARLearn: A Unified Deep Learning Library for 3D Point Cloud Classification, Segmentation, and Self-Supervised Representation Learning [1.2599533416395765]
Three-dimensional (3D) point cloud analysis has become central to applications ranging from autonomous driving and robotics to forestry and ecological monitoring.<n>lib is a unified, PyTorch library that integrates over 55 model configurations covering 29 supervised architectures, seven SSL pre-training methods, and five PEFT strategies.<n>lib provides standardised training runners, cross-validation with stratified $K$-fold splitting, automated/CSV table generation, built-in Friedman/Nemenyi statistical testing with critical-difference diagrams for rigorous multi-model comparison, and a comprehensive test suite with 2,200+ automated tests
arXiv Detail & Related papers (2026-04-12T19:10:12Z) - Resource-Efficient Iterative LLM-Based NAS with Feedback Memory [49.44875022114861]
Neural Architecture Search (NAS) automates network design, but conventional methods demand substantial computational resources.<n>We propose a closed-loop pipeline leveraging large language models (LLMs) to iteratively generate, evaluate, and refine convolutional neural network architectures.
arXiv Detail & Related papers (2026-03-12T16:00:22Z) - H2LooP Spark Preview: Continual Pretraining of Large Language Models for Low-Level Embedded Systems Code [7.026788530015788]
H2LooP Spark Preview is a continual pretraining pipeline that adapts the OLMo-3-7B-a fully open language model to the embedded systems domain.<n>Our training corpus is constructed from repository-datasheet pairs covering 100B tokens of raw embedded systems data across 117 manufacturers.<n>Continual pretraining with high-rank LoRA yields substantial gains, reducing in-domain perplexity by 70.4% and held-out repository perplexity by 66.1%.
arXiv Detail & Related papers (2026-03-11T16:32:14Z) - Accelerating Training and Inference of Graph Neural Networks with Fast
Sampling and Pipelining [58.10436813430554]
Mini-batch training of graph neural networks (GNNs) requires a lot of computation and data movement.
We argue in favor of performing mini-batch training with neighborhood sampling in a distributed multi-GPU environment.
We present a sequence of improvements to mitigate these bottlenecks, including a performance-engineered neighborhood sampler.
We also conduct an empirical analysis that supports the use of sampling for inference, showing that test accuracies are not materially compromised.
arXiv Detail & Related papers (2021-10-16T02:41:35Z) - Key Points Estimation and Point Instance Segmentation Approach for Lane
Detection [65.37887088194022]
We propose a traffic line detection method called Point Instance Network (PINet)
The PINet includes several stacked hourglass networks that are trained simultaneously.
The PINet achieves competitive accuracy and false positive on the TuSimple and Culane datasets.
arXiv Detail & Related papers (2020-02-16T15:51:30Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.