arXiv Machine Learning

A First Glance at Jev for Network Traffic Classification: Accuracy, Processing Time, and Cost

The paper evaluates Jev, a general-purpose decision model, for classifying network traffic using only the first ten packets’ sizes, directions, and inter‑packet times. Across 52,000 records, adding 40 labeled examples improves Jev’s accuracy from 9.80% to 28.42%, yet Random Forest and Extra Trees models trained on 8,000 records achieve higher accuracies of 69.95% and 66.80%. Even with 150 examples, Jev reaches only 34.50% accuracy, and in a paired 100‑record test, Jev’s 29% accuracy and 0.750 s median request time are lower than the generative OpenAI GPT‑5.6 Sol’s 37% accuracy and 6.036 s response time, though Jev incurs lower API charges.

arXiv AI
Oct 2

Jev-IDS: System One Models for Network Intrusion Detection

JEV-IDS is an open experimental general network intrusion detection system that uses the Jev System One Model to detect zero‑day intrusions even when labeled data are scarce. The system processes one flow per request and asks the model two questions: a binary attack probability and a finite‑choice traffic category. In tests on a 300‑flow NSL‑KDD pilot split, JEV-IDS achieved an F1‑score of 0.859, precision of 0.941, recall of 0.790, and a novel‑attack recall of 0.838, while being 4.8 times faster and 3.8 times cheaper than GPT‑5.6 Luna and producing 15 times fewer false alarms than a low‑data Random Forest.

By Paulo Severo, Silvio E. Quincozes, Amanda Dias
arXiv AI
Oct 2

HydroJEV: A one-second, training-free screen for cyber-attack and fault attribution in water distribution networks

HydroJEV is a training‑free, one‑second model that classifies SCADA alarms in water distribution networks into cyberattack, physical fault, normal transient, or faulty sensor. In a benchmark on the C‑Town EPANET network, HydroJEV matched a hand‑written rule tree and outperformed a supervised classifier, especially when few labeled events were available, while being 20‑40 times faster than large language models. When combined with a rule tree gate, it reduced the need for human review by about a third without sacrificing accuracy.

By Tianwei Mu, Shengyan Jiang, Mingzhe Yuan, Qing Luo, Min Xiao, Wenhong Wang, Jun Li, Manhong Huang
arXiv Machine Learning
5d ago

JevForest: Path Voting for Budgeted Feature Acquisition

JevForest is a feature‑acquisition policy that aggregates path‑dependent proposals from bootstrapped trees, weights them by global training information gain, and uses a shared masked classifier to predict from the acquired values. In online experiments, a four‑question forest on AG News achieved 0.729 accuracy versus 0.667 for a static gain ranking and 0.583 for random ordering, while on TREC the ordering reversed. Offline MiniBooNE tests showed accuracies of 0.845 with ten features and 0.885 with forty features, indicating that Jev’s effectiveness varies with task, predictor, and budget constraints.

By Yu Yan
arXiv Machine Learning
Oct 3

Benchmarking System One decision models against trained classifiers and language models for automated decision gates

The paper evaluates System One decision models—typed models that output probabilities for branching decisions—against supervised classifiers and generative language models on automated decision gate tasks. Eight checkpoints from six families, including the hosted model Jev, were benchmarked on workflow, intent, and social‑science items, showing that small trained classifiers match or slightly outperform decision models on intent and workflow when labels are available, while decision models outperform zero‑shot classifiers when labels are absent. The study also explores calibration, risk thresholds, and cost‑efficiency trade‑offs, providing condition‑dependent design guidelines for automated decision gates.

By Amir Rafe, Subasish Das
arXiv Computation and Language
2d ago

AMLworld-Compact: Importance-Weighted Downsampling for Cost-Effective LLM Evaluation and Error Diagnosis

arXiv:2610.13627v1 Announce Type: new Abstract: Evaluating large language models (LLMs) on AMLworld's smallest test splits is costly because each of over a million targets requires a separate graph p...

By Natapong Nitarach, Phume Ngampornsukswadi, Pittawat Taveekitworachai, Surapon Nonesung, Warit Sirichotedumrong, Kunat Pipatanakul
arXiv Machine Learning
Oct 3

LESS: Lightweight Evolutionary Supernet Search in Minutes

LESS (Lightweight Evolutionary Supernet Search) is a data‑driven NAS method that uses a brief hard‑path warm‑up and CMA‑ES to evaluate candidate architectures as decoded hard genotypes after six supernet updates. On NAS‑Bench‑201, LESS attains 93.189 % CIFAR‑10 accuracy in just 409.1 seconds, nearly matching FairNAS while using only about 1/24 of its search time. The approach also transfers well to CIFAR‑100, ImageNet16‑120, and the larger DARTS space, achieving high accuracies with searches completed in roughly 43.5 minutes on a single GPU.

By Aviral Gandhi, Jinglue Xu, Jialong Li, Hitoshi Iba
arXiv Machine Learning
Sep 3

SoK: Where Do Flow Labels Come From? Auditing Label Provenance in Encrypted Traffic Benchmarks

The paper audits 14 encrypted traffic classification benchmarks to investigate how flow labels are generated. It finds two common labeling strategies—coarse inheritance, which may mislabel flows, and overstrict filtering, which may discard useful flows—leading to inconsistencies between benchmark labels and actual traffic records. The study also quantifies the impact of these labeling practices on classifier accuracy, showing that inherited labels limit balanced accuracy to 0.56–0.76, while filtering can raise macro accuracy from 0.44 to 0.65.

By Sizhe Huang, Shujie Yang