TASKSCULPT mark
TASKSCULPTTask-Conditioned Computational Surgery
Off-the-shelf LLM · no task-specific fine-tuning · calibration-driven structural + precision surgery

Find the smallest machine a task actually needs.

TASKSCULPT asks a deployment-first question: when one general-purpose LLM will repeatedly serve one task, which computation must survive, which structure can disappear, and how much precision does every surviving region truly require?

Same model. Same deployment budget. Different task → different optimal compression.
10 students · 12 weeks4 hard research gates≥99% primary retention targetMEASURED / ESTIMATED / SIMULATED / TARGET separated
TASKSCULPT logo
Computational surgery, not generic shrinking.
The sculpted monogram mirrors the method: preserve task-critical structure; remove or thin everything else under an explicit performance budget.
01 · Extended abstract

Problem → Method → Target Outcome

Targets are not empirical claims

In many real deployments, a large language model is not expected to remain an all-rounder: it repeatedly performs one specific task, such as question answering, summarization, translation, sentiment classification, or natural-language inference. Yet contemporary model compression largely remains model-centric—applying broadly similar pruning or quantization policies regardless of what the deployed model will actually be asked to do. This can preserve computational capacity valuable for general-purpose behavior but unnecessary for the target workload. We investigate a different question: how much of an off-the-shelf LLM is actually required to preserve a single task? Starting directly from the same pretrained open-weight model, without task-specific fine-tuning, we hypothesize that different tasks depend on distinct computational structures and require different numerical precision across those structures. Consequently, the optimal compressed model should be viewed not as a property of the backbone alone, but as a joint property of the model, target task, and deployment budget.

We introduce TASKSCULPT, a framework for Task-Conditioned Computational Surgery that discovers and exploits this structure across multiple architectural resolutions. Given only a task calibration set, TASKSCULPT progressively profiles the model from transformer layers to attention/MLP sub-blocks, attention heads and projections, MLP channel groups, and quantization groups. Rather than assigning importance using a single magnitude heuristic, TASKSCULPT separates inexpensive screening signals from causal ground truth, estimates task-conditioned sensitivity through causal knockout, gradient/Fisher information, activation-aware saliency, and direct compression perturbations, and constructs a task-specific structural rate–distortion function Dt(u,a) for preservation, structured removal, and BF16/FP8/INT8/INT4/INT3/INT2 precision. Selective pairwise interventions probe conditional redundancy: structures that appear removable individually but become critical when compressed together. A closed-loop, hardware-constrained optimizer jointly determines what computation to remove and what precision the surviving computation requires, subject to a strict task-retention constraint. The central causal control is wrong-task map transfer, where a model for one task is compressed using another task’s topology under identical memory, sparsity, calibration, and average-bit budgets.

We plan to evaluate the same off-the-shelf 7–8B-class model across SST-2, MNLI, SQuAD 2.0, XSum, and machine translation, against uniform low-bit quantization, activation- and second-order-aware quantization, generic structural pruning, and recent task-aware pruning and mixed-precision methods. The primary commercial operating point targets ≥99% retention of the original task performance while testing whether TASKSCULPT can reach approximately 6× lower raw weight memory, ~30% hardware-realizable structural removal, ~3.8 average effective bits, and ~2× inference acceleration; a more aggressive frontier targets ≥98% retention. These are explicit engineering targets, not achieved results. The decisive empirical question is whether task-matched compression consistently dominates both task-agnostic policies and wrong-task compression at identical deployment budgets. If confirmed, the implication is a different specialist-LLM deployment paradigm: extract the minimum task-preserving computational subnetwork and precision topology from the stronger general-purpose backbone itself.

02 · 12-week research mission

Hypothesis → Causal Evidence → Compression → Hardware Value

Ten students, six workstreams, four hard gates. The plan is intentionally falsifiable: later phases are earned by evidence rather than assumed at project start.

ACTIVE · W1 · BASE
Benchmark Harness LayerMap Hierarchical Map Wrong-Task Matrix Structural R–D Interaction Graph Precision R–D Joint Policy Deployable Policy Hardware Pareto 5×5 Transfer Paper + Studio
W1 · BASELINEReference first

Freeze task score, BF16 footprint, VRAM, prefill/decode latency and throughput.

W4 · SCIENCE GATEDoes task matter?

Matched map must beat wrong-task map at the same deployment budget.

W8 · COMPRESSION GATEBeat ordinary INT4

Target meaningful gain beyond generic 4-bit quantization while holding ≥99% task retention.

W10 · BUSINESS GATESmaller must become faster

Actual latency/throughput and GPU memory—not only theoretical bits or FLOPs.

03 · Mathematical core

Remove → Shrink → Interact → Optimize

The equations are paired with an intuitive question. Expensive causal interventions are the reference signal; cheap estimators exist to make hierarchical profiling feasible.

REMOVE

Does the task need this computation?

Knock out a structure and measure what actually breaks on the target task.

Dt(u, prune)
SHRINK

How imprecise can it become?

Keep the structure but progressively lower its numerical precision.

Dt(u, b), b∈{8,4,3,2}
INTERACT

What must survive together?

Identify components whose redundancy is conditional on another component being preserved.

It(u,v)
OPTIMIZE

What is the cheapest safe topology?

Spend a strict task-performance budget on actions with the best hardware saving per unit task damage.

arg min CHW(a)
01 · Fixed backbone

Same model, task changes only the probe

No SFT/LoRA before compression. Only the calibration distribution changes.

M=fθ
Dtcal varies with task t
θ fixed
02 · Causal criticality

Reference signal

Task loss/score change after intervention defines the causal damage we want cheap estimators to predict.

Ctcausal(u)=Lt(M−u)−Lt(M)
03 · Cheap estimators

Screen before intervention

Gradient/Fisher, activation, weight×activation and representation influence nominate candidate structures.

φt(u)=[Gt,Ft,At,W×A,BI]
04 · Damage surface

Importance is not enough

Every structural/numerical action has an explicit task cost.

Dt(u,a)=St(M)−St(Mu→a)
05 · Conditional redundancy

Pairwise non-additivity

Selective pairs expose compensation and jointly critical structures.

It(u,v)=Dt({u,v})−Dt(u)−Dt(v)
06 · Joint action

Structure + precision

The action decides whether a unit survives and at what numerical precision.

au=(su,bu)
s∈{keep,prune}, b∈{16,8,4,3,2}
07 · Hardware objective

Optimize what deployment pays for

Unsupported actions are masked; real memory/latency can replace symbolic costs as measurements mature.

at*=arg min CHW(a)
CHW=αM+βL+γE
08 · Hard retention

Performance is the constraint

Surrogates propose; native task metrics validate.

St(Ma)≥(1−ε)St(M), ε∈{.01,.02}
09 · Wrong-task test

Prove topology is task-specific

Matched and mismatched policies are compared at exactly the same deployment budget.

Δwrong=St(MCt)−St(MCs), s≠t
Untouched checkpointSame downloaded backbone for every task.
No task SFTCalibration/profiling only before compression.
Matched budgetsWrong-map controls match memory, bits and sparsity.
Closed loopRe-profile near compression decision boundaries.
Evidence labelsMEASURED · ESTIMATED · SIMULATED · TARGET stay distinct.
04 · Interactive scientific instrument

TASKSCULPT 3D — Computational Surgery Studio

The geometry itself carries meaning: slab = layer, crown = criticality, needle = Fisher, cloud = activation, thickness = precision, ghost = removed capacity, bridge = interaction, fissure = wrong-task conflict.

MAP EXPLANATION
Initializing TASKSCULPT 3D…
Qwen-class 8B · GENERAL-PURPOSE MODELSame untouched backbone. Select a task to scan where that task places computational value.
drag → constrained orbit · scroll → zoom · click → inspect · double click → microscope · X → explode · F → focus · R → reset
05 · Business decomposition

Where Does the Compression Actually Come From?

Every number below is an illustrative target decomposition until experiments replace it. The purpose is to separate generic low-bit gains from the incremental value of task conditioning, structural removal, interaction checks and deployable alignment.

Compression Waterfall

Sequential footprint reduction is shown rather than misleadingly adding compression multipliers. Toggle techniques to see which ideas must earn their complexity.

Operating Points

The business question is not “can the model be compressed?” but whether task-aware surgery meaningfully outperforms commodity INT4 and then translates into real GPU economics.

PRIMARY TARGET · NOT RESULT≥99%

Aim for ~5–6× raw-weight compression and material hardware speedup.

STRETCH FRONTIER · NOT RESULT≥98%

Explore whether ~7–9× compression is reachable without unacceptable task loss.

Four Possible Outcomes

A strong plan includes explicit negative-result paths.

Task maps diverge, matched-map compression wins, and hardware value survives deployment alignment: full TASKSCULPT scientific + product story.
06 · Research foundations

Clickable Literature Map

Structural compression, task-conditioned structure, pruning and numerical compression are separated so the novelty boundary remains explicit. Every paper opens in a new tab; “Show in Studio” activates the closest visual lens.