PRECOG: A Polysemous Framework for Anticipatory Inference

• PRECOG is a research label representing diverse anticipatory inference frameworks, used for tasks like cloud memory-leak detection, neural motor planning, and language model forecasting.
• Different implementations leverage varied methodologies—from regression and change-point analysis in cloud systems to HMMs and LASSO in ECoG decoding and quality control systems.
• Empirical results across domains highlight improved detection accuracy, reduced computation times, and enhanced strategic planning, underscoring PRECOG's practical significance despite its polysemous nature.

Searching arXiv for recent and relevant PRECOG-related papers to ground the article. PRECOG, Precog, and PrecoG are recurrent labels in the research literature, but they do not denote a single framework. The name has been used for at least nine distinct constructs: an online memory-leak detector for cloud virtual machines, a three-stage electrocorticographic decoding pipeline for pre-movement force planning, a pre-failure detector for coding agents based on “strained coherence,” a memorization score for pretrained LLMs, a goal-conditioned probabilistic forecaster for multi-agent driving, a graph-Laplacian preconditioner for transform-domain LMS, a corpus for text-only LLM performance forecasting, a pre-hoc crowdsourcing quality-control system, and a protocol for strategic foresight (Jindal et al., 2021, Jindal et al., 2021, Wu et al., 2016, Pandya et al., 5 Jun 2026, Ranaldi et al., 2023, Rhinehart et al., 2019, Batabyal et al., 2018, Park et al., 25 Sep 2025, Fujiyoshi, 6 Mar 2026). Across these uses, the common theme is anticipatory inference, but the operational object of prediction ranges from resource exhaustion and motor intent to benchmark scores, human text quality, and strategic timing.

1. Research usages and nomenclature

The label appears with different expansions and capitalization conventions, including “PREdiction Conditioned On Goals,” “PreCog,” “PrecoG,” and “PRECOG PROTOCOL.” The underlying research programs are unrelated in methodology, data modality, and evaluation target.

Usage	Research object	Representative paper
Precog / PrecogMF	Cloud VM memory-leak detection from memory-utilization time series	(Jindal et al., 2021, Jindal et al., 2021)
“Precognitive” decoding	Pre-movement ECoG decoding of force direction and onset	(Wu et al., 2016)
Strained coherence for PRECOG	Pre-failure signal in coding-agent trajectories	(Pandya et al., 5 Jun 2026)
PreCog	Memorization score for pretrained LLMs	(Ranaldi et al., 2023)
PRECOG	Goal-conditioned visual multi-agent trajectory forecasting	(Rhinehart et al., 2019)
PrecoG	Unitary split preconditioner via graph Laplacian regularization	(Batabyal et al., 2018)
PRECOG	Corpus for text-only LLM performance forecasting	(Park et al., 25 Sep 2025)
PreCog	Pre-hoc crowdsourced data-quality improvement	(Nilforoshan et al., 2017)
PRECOG PROTOCOL	Executable framework for strategic foresight	(Fujiyoshi, 6 Mar 2026)

A persistent misconception is that PRECOG names a single family of models. The literature instead uses the name polysemously. As a result, technical statements about “PRECOG” are only meaningful when anchored to a specific domain and arXiv identifier.

2. Cloud-based memory-leak detection

In cloud systems research, Precog is a “black-box,” online algorithm for detecting memory leaks from a single VM’s memory-utilization time series. The setting assumes no access to application internals, heap dumps, object allocations, or language runtime telemetry. The observed signal is $x=\{x_1,\dots,x_N\}$, where $x_t\in[0,100]$ is RAM utilization at minute $t$. Detection is framed over a sliding window $x_{t-T:t}$: a window is anomalous if its future linear trend will hit a critical utilization $U$ within a lead time $C$ (Jindal et al., 2021, Jindal et al., 2021).

The core model is ordinary least squares on a candidate segment or window. In the later comparative formulation, the fitted line is $h(\tau)=\theta_0+\theta_1\cdot\tau$, with goodness-of-fit measured by $R^2$, and time to threshold estimated as $t_U=(U-\theta_0)/\theta_1$ when $\theta_1>0$. A segment is flagged if $x_t\in[0,100]$0 and the estimated crossing occurs within $x_t\in[0,100]$1. The earlier online-detection paper expresses the same logic with $x_t\in[0,100]$2, $x_t\in[0,100]$3, and $x_t\in[0,100]$4 (Jindal et al., 2021, Jindal et al., 2021).

Precog’s distinctive step is change-point detection. First differences are computed, transformed to z-scores, and indices exceeding $x_t\in[0,100]$5 or $x_t\in[0,100]$6 are treated as change points; the method enforces a minimum spacing such as $x_t\in[0,100]$7 hours to suppress spurious boundaries. Offline training scans historic series between change points, extracts trends summarized by slope and duration, and stores the resulting historic trend set together with global maxima. Online detection fits a line on segments between recent change points and declares an anomaly if the current slope-duration pair exceeds either the global maxima or one of the stored historic trends. PrecogMF adds an extra maximum-based filter: if a segment is otherwise anomalous but its maximum utilization remains below the historic maximum for an equal-length segment, the anomaly is overridden to normal (Jindal et al., 2021).

The experimental setting is explicit. The later comparative paper uses 60 cloud VMs over 5 days at 1-minute resolution, with 20 VMs experiencing real leaks and Huawei labels. Data are resampled to 5-minute intervals and median-smoothed over a 1-hour window. Shared hyperparameters are a minimum trend duration of 6 hours, $x_t\in[0,100]$8 days, $x_t\in[0,100]$9, and $t$0. Under this comparison, LBR attains $t$1 in $t$2 s, LBRCPD $t$3 in $t$4 s, Precog $t$5 in $t$6 s, and PrecogMF $t$7 in $t$8 s, corresponding to an $t$9 time reduction relative to LBR (Jindal et al., 2021).

The earlier online-detection paper reports a closely related but not identical headline result. On 60 real VMs, it gives $x_{t-T:t}$0, $x_{t-T:t}$1, $x_{t-T:t}$2, hence Precision $x_{t-T:t}$3, Recall $x_{t-T:t}$4, $x_{t-T:t}$5, with average prediction time $x_{t-T:t}$6 s per 500-point test window; it also reports overall $x_{t-T:t}$7 on a synthetic 90-positive/90-negative dataset spanning linear, linear+noise, and sawtooth patterns (Jindal et al., 2021). Reported headline scores therefore differ across the two papers: the earlier work reports $x_{t-T:t}$8 for Precog itself, whereas the later four-way comparison reports $x_{t-T:t}$9 for Precog and $U$0 for PrecogMF.

The same line of work classifies leak traces into three visual classes: linearly-increasing, random, and saw-tooth. Linear growth is directly compatible with the regression criterion; random patterns are “not reliably detectable by single-metric regression”; and saw-tooth traces encode repeated growth-reset cycles, such as container restart after OOM. This classification is operational rather than merely descriptive, because parameters such as $U$1 are chosen relative to reset intervals (Jindal et al., 2021).

3. Precognition as precursor detection: motor planning and coding-agent failure

One use of “precognitive” in the literature is literal early decoding of human motor intent from neural data. The ECoG study on upper-limb 3D isometric force application introduces a three-stage pipeline combining jPCA reduced-rank hidden Markov models, regularized shrunken-centroid discriminant analysis, and LASSO regression. High-dimensional wavelet/LMP signals $U$2 are projected into a $U$3 dimensional jPCA subspace, clustered into 12 observed symbols, and modeled with six left-to-right HMMs, one for each force direction, each with 8 hidden states and 12 observed symbols. Leave-one-out cross-validation yields a 6-way direction-classification accuracy of $U$4, versus $U$5 chance (Wu et al., 2016).

The same study evaluates a direct discriminative alternative. RDA regularizes class covariances and shrinks class centroids toward the global mean; the best grid-searched setting retains 27 spectral-channel-time features and yields $U$6 accuracy, again above chance. The surviving features localize direction-sensitive pre-movement information to approximately $U$7 ms before onset over ipsilateral dorsal premotor cortex, then approximately $U$8 ms in adjacent premotor cortex, and finally approximately $U$9 ms pre-onset in contralateral M1. A separate LASSO model for continuous force prediction identifies $C$0 of true onsets within $C$1 ms and $C$2 within $C$3 ms, with a $C$4 false-positive rate (Wu et al., 2016).

A different precursor-detection usage appears in LLM-agent safety. “Strained coherence” is defined formally on a trajectory $C$5 of think steps and actions: $C$6 The failure mode is therefore not generic inconsistency but a specific pattern in which the agent explicitly acknowledges a conflict and then proceeds without resolving it. Detection is implemented by a Claude Sonnet 4.6 judge over full ATIF-v1.5 JSON trajectories, outputting span-level JSON with start/end indices, quoted acknowledgment, quoted action, conflict type, and a 1–5 confidence score (Pandya et al., 5 Jun 2026).

Quantitatively, on 44 Terminal-bench-2 trajectories generated by a Qwen3.5-35B-A3B backbone, flagged trajectories fail $C$7 of the time, versus $C$8 for unflagged trajectories, a 47-point gap with Fisher’s exact $C$9. At matched selectivity of 16 flags, the detector reaches $h(\tau)=\theta_0+\theta_1\cdot\tau$0 precision versus $h(\tau)=\theta_0+\theta_1\cdot\tau$1 for a lexical discourse-marker baseline; the 10-trajectory intersection of the two methods has a $h(\tau)=\theta_0+\theta_1\cdot\tau$2 failure rate with Clopper–Pearson $h(\tau)=\theta_0+\theta_1\cdot\tau$3 CI $h(\tau)=\theta_0+\theta_1\cdot\tau$4. On Gemma4-31B, the overall pattern is directionally consistent but not statistically significant, with a 20-point gap and $h(\tau)=\theta_0+\theta_1\cdot\tau$5, and the paper attributes attenuation largely to 13 trajectories with zero think content. The first flag appears late: median $h(\tau)=\theta_0+\theta_1\cdot\tau$6 elapsed trajectory time for Qwen and $h(\tau)=\theta_0+\theta_1\cdot\tau$7 for Gemma, making the signal suitable for late-stage intervention rather than early compute reallocation (Pandya et al., 5 Jun 2026).

Taken together, these two uses share a precise temporal logic: the signal is useful because it appears before the event of interest. In one case the event is force onset; in the other it is execution failure. The underlying measurement substrates, however, are entirely different: ECoG dynamics in one instance, deliberative language-and-action traces in the other.

4. PRECOG in language-model research

In NLP, PreCog has been introduced as a memorization measure for pretrained masked LLMs. For a token sequence $h(\tau)=\theta_0+\theta_1\cdot\tau$8, each position is masked in turn to form $h(\tau)=\theta_0+\theta_1\cdot\tau$9, the pretrained BERT MLM is queried for its top-$R^2$0 prediction set at the masked position, and the score is

$R^2$1

In the reported experiments $R^2$2, so the score is the fraction of positions whose original token is recovered as the single most likely MLM prediction. The measure uses only the original pretrained BERT-base MLM head and no fine-tuning labels (Ranaldi et al., 2023).

The main empirical question is whether memorization, as measured by PreCog, correlates with downstream task accuracy. The protocol computes PreCog for each GLUE example, sorts examples into five equal-sized bins, fine-tunes BERT in the standard way, and reports accuracy by bin. Across all GLUE bins, Pearson correlation between Length and accuracy is $R^2$3 with $R^2$4, between LexCov and accuracy $R^2$5 with $R^2$6, and between PreCog and accuracy $R^2$7 with $R^2$8. In task-specific comparisons, examples with PreCog in $R^2$9 are reported as 5–15 points more accurate than examples with PreCog $t_U=(U-\theta_0)/\theta_1$0; the summary highlights approximately $t_U=(U-\theta_0)/\theta_1$1 versus $t_U=(U-\theta_0)/\theta_1$2 on MNLI, approximately $t_U=(U-\theta_0)/\theta_1$3 versus $t_U=(U-\theta_0)/\theta_1$4 on RTE, and approximately $t_U=(U-\theta_0)/\theta_1$5 versus $t_U=(U-\theta_0)/\theta_1$6 on SST-2 (Ranaldi et al., 2023).

A separate LLM line of work uses PRECOG to denote a forecasting corpus rather than a score. The corpus contains 767 experimental records spanning 528 unique datasets and 631 unique papers, covering seven metric families normalized to a 0–100 scale: Accuracy, F1, Recall, Precision, Exact Match, ROUGE, and BLEU. Each instance pairs a fully self-contained redacted description $t_U=(U-\theta_0)/\theta_1$7, approximately 200–600 tokens, with a normalized target performance $t_U=(U-\theta_0)/\theta_1$8. Source papers are excluded from the retrieval corpus in the zero-leakage setting, and a second LLM pass plus rule-based checks enforce anonymization. A 30-sample human audit reports $t_U=(U-\theta_0)/\theta_1$9 anonymization pass rate, mean schema coverage $\theta_1>0$0, and mean source grounding $\theta_1>0$1 (Park et al., 25 Sep 2025).

The forecasting task is regression from description to score. On the full 767-instance benchmark, the test-set mean baseline yields MAE $\theta_1>0$2, E5-Mistral + kNN $\theta_1>0$3 with $\theta_1>0$4, E5-Mistral + XGBoost $\theta_1>0$5 with $\theta_1>0$6, GPT-5 without search $\theta_1>0$7 with $\theta_1>0$8, and GPT-5 with arXiv retrieval $\theta_1>0$9 with $x_t\in[0,100]$00; the reported GPT-5 and Qwen3 correlations marked with a dagger are significant at $x_t\in[0,100]$01 by one-sided binomial sign test (Park et al., 25 Sep 2025).

The same paper reports a high-confidence regime in which models self-report confidence categories and evaluation is restricted to a retained subset $x_t\in[0,100]$02. On the Accuracy subset, MAE falls as the confidence threshold rises, with the best reported high-confidence MAE reaching $x_t\in[0,100]$03. Retrieval behavior is also quantified: GPT-5 averages $x_t\in[0,100]$04 search calls per instance with $x_t\in[0,100]$05, versus $x_t\in[0,100]$06 and $x_t\in[0,100]$07 for Qwen3-32B; aggregate query-token diversity is 2,140 unique tokens for GPT-5 and 794 for Qwen3-32B (Park et al., 25 Sep 2025).

These two NLP usages employ the same name for different epistemic objects. One estimates how much a pretrained MLM “recalls” from pretraining; the other estimates how well an LLM will score on a task from a redacted task description.

5. Goal conditioning and numerical conditioning

The 2019 driving paper expands PRECOG as “PREdiction Conditioned On Goals in Visual Multi-Agent Settings.” The setting consists of $x_t\in[0,100]$08 interacting agents with joint future trajectories

$x_t\in[0,100]$09

past history $x_t\in[0,100]$10, and robot-centric observation $x_t\in[0,100]$11. Standard forecasting models $x_t\in[0,100]$12, whereas conditional forecasting additionally conditions on a robot goal $x_t\in[0,100]$13, implemented in experiments as a Gaussian likelihood on the final robot state. The model is a multi-agent normalizing flow $x_t\in[0,100]$14 that maps factorized Gaussian latents $x_t\in[0,100]$15 to joint trajectories, with per-agent past-trajectory GRUs of size 128, an 8-layer fully convolutional LIDAR encoder, social features, whisker-features, and an autoregressive invertible “Verlet-step”

$x_t\in[0,100]$16

Because the flow is invertible, the model supports exact log-likelihood training and goal-conditioned latent optimization (Rhinehart et al., 2019).

The reported datasets are CARLA and nuScenes. In CARLA, the paper extracts 60,701 train, 7,586 validation, and 7,567 test scenes from 900 episodes, with 2 s past and 2 s future at 10 Hz. In nuScenes, it samples 2 s past and 4 s future at 5 Hz from 850 real-world episodes. Metrics are $x_t\in[0,100]$17 and normalized forward cross-entropy (“extra nats”). For forecasting with $x_t\in[0,100]$18, the ESP model with LIDAR reduces CARLA $x_t\in[0,100]$19 from $x_t\in[0,100]$20 to $x_t\in[0,100]$21 and $x_t\in[0,100]$22 from $x_t\in[0,100]$23 to $x_t\in[0,100]$24 relative to R2P2-MA; on nuScenes, ESP+RoadMask reduces $x_t\in[0,100]$25 from $x_t\in[0,100]$26 to $x_t\in[0,100]$27 and $x_t\in[0,100]$28 from $x_t\in[0,100]$29 to $x_t\in[0,100]$30. Under conditional forecasting, PRECOG reduces joint $x_t\in[0,100]$31 from $x_t\in[0,100]$32 to $x_t\in[0,100]$33 in CARLA Town02 and from $x_t\in[0,100]$34 to $x_t\in[0,100]$35 in nuScenes, while also improving forecasts for other agents once the robot goal is known (Rhinehart et al., 2019).

A mathematically unrelated use appears in adaptive signal processing. “PrecoG” is an efficient unitary split preconditioner for transform-domain LMS, learned through graph Laplacian regularization. The input taps are modeled as a weighted graph $x_t\in[0,100]$36 with graph Laplacian $x_t\in[0,100]$37. Its eigendecomposition $x_t\in[0,100]$38 provides an orthonormal transform $x_t\in[0,100]$39, yielding transformed data $x_t\in[0,100]$40. The design objective is to make the power-normalized transformed autocorrelation close to the identity, minimizing Frobenius-norm penalties involving $x_t\in[0,100]$41, its diagonal, and a regularizer on edge weights. Weight updates use first-order eigenvector perturbation, and the resulting transform acts as a unitary split preconditioner in both LMS and linear system solution (Batabyal et al., 2018).

The paper emphasizes condition-number reduction as the target. After transformation and power normalization, the conditioned autocorrelation is intended to have eigenvalues in $x_t\in[0,100]$42, so the condition number approaches $x_t\in[0,100]$43. In the fully connected case, each gradient update over all edge weights is $x_t\in[0,100]$44, though sparsity can reduce this. On regularized Hilbert matrices, random positive-definite Gaussian matrices, sparse systems, AR(1), AR(2), and Hebb-LMS settings, PrecoG is reported to outperform DCT, DFT, Gauss-Seidel, Jacobi, and ILU in condition-number reduction or convergence behavior (Batabyal et al., 2018).

These two usages share only the abstract notion of conditioning. In autonomous driving, prediction is conditioned on a goal variable. In adaptive filtering, a linear system or autocorrelation structure is conditioned numerically through a learned unitary transform.

6. Pre-hoc quality control and strategic foresight

In crowdsourcing, PreCog denotes a pre-hoc interface-optimization system for improving data quality before submission. Its central design pattern is Segment-Predict-Explain. Offline, the system segments historical documents, extracts 47 features in five categories—Informativeness, Topic, Subjectivity, Readability/Grammar, and Similarity—and trains Random Forest classifiers for document-level and segment-level quality. Online, new worker text is segmented, featurized, and scored; low-quality segments are highlighted, and an Explanation Generator selects prescriptive feedback through Feature Explanation Functions (FEFs) and the TCruise heuristic over Random Forest paths (Nilforoshan et al., 2017).

Segmentation is handled by TopicTiling by default: the document is tokenized into sentences, LDA topic distributions are computed over sliding windows, and a boundary is emitted when the $x_t\in[0,100]$45 distance between adjacent topic windows exceeds a threshold. Explanation is formalized by a responsibility score over feature perturbations, normalized by perturbation magnitude and modulated by model confidence. Exact solution is exponential in feature count, so TCruise approximates the selection of influential feature changes in time linear in the number of tree paths. The paper reports interactive latency of approximately $x_t\in[0,100]$46 s (Nilforoshan et al., 2017).

The reported evaluation spans hard constraints and ambiguous text tasks. For simple relational-style constraints, two Precog interfaces yield $x_t\in[0,100]$47 and $x_t\in[0,100]$48 more valid tuples than no-Precog. For text acquisition, Precog collects at least $x_t\in[0,100]$49 more high-quality reviews and at least $x_t\in[0,100]$50 more high-quality host profiles than the baseline at selected quality thresholds. Mean rubric-score improvements are $x_t\in[0,100]$51 versus $x_t\in[0,100]$52 for reviews and $x_t\in[0,100]$53 versus $x_t\in[0,100]$54 for host profiles. The document-level Random Forest achieves approximately $x_t\in[0,100]$55 accuracy on Amazon DVD reviews and approximately $x_t\in[0,100]$56 on Airbnb trustworthiness; segment-level RF predictions show approximately $x_t\in[0,100]$57 agreement with human segment labels (Nilforoshan et al., 2017).

A separate 2026 usage, PRECOG PROTOCOL, is an executable framework for strategic foresight rather than a predictive model. It systematizes horizon scanning, weak-signals theory, and scenario planning into five steps: Signal Map, Convergence Analysis, Contrarian View, Timing Grid, and Action Window. A single session is designed to take 1–2 hours. Step 1 records 3–8 signals, each tagged by strength $x_t\in[0,100]$58, direction $x_t\in[0,100]$59, and confidence $x_t\in[0,100]$60. Step 2 groups convergent signals into hypotheses $x_t\in[0,100]$61 with confidence levels. Step 3 constructs contrarian scenarios with explicit preconditions, collapse triggers, and probability estimates. Step 4 places the thesis on four timing axes: Market Phase, Competitive Timing, Organizational Readiness, and External Window. Step 5 maps the result into Now, Soon, Watch, and Kill action buckets, each with triggers and cost or resource estimates (Fujiyoshi, 6 Mar 2026).

The protocol includes explicit anti-pattern detection. In version 2, if all four timing axes align in an unambiguously favorable or unfavorable direction, an escalated Contrarian View is triggered to counter confirmation bias. Longitudinal re-runs of the protocol delta-tag signals as Strengthened, Stable, Weakened, New, or Dead, and version 2 adds a “Signal Freshness” check when more than 50% of signals are unchanged. Across the paper’s three evaluation modes, the batch experiment covers eight random domain pairings with success rate $x_t\in[0,100]$62 and failure rate $x_t\in[0,100]$63, and a blind evaluation scores protocol output $x_t\in[0,100]$64 versus $x_t\in[0,100]$65 for brainstorming (Fujiyoshi, 6 Mar 2026).

These systems are pre-hoc in different senses. PreCog intervenes before data acquisition to improve the quality of worker submissions; PRECOG PROTOCOL intervenes before strategic commitment by forcing explicit signal collection, contrarian testing, and timing judgments. The shared emphasis is procedural anticipation rather than post-hoc correction.