Paper Reading AI Learner

Decision-FLIP: Budget-Free Structured Pruning for Gaussian Occupancy Models

2026-10-14 20:48:09
Jingxing Li, Anurag Paul, Subhasis Das, Cindy Xu

Abstract

Occupancy predictors rely on large persistent banks of Gaussians or learned queries whose size is fixed by hand. Common pruning proxies, such as opacity, activation frequency, or parameter magnitude, do not measure whether removing a row changes the model's voxel decisions. We introduce Decision-FLIP, a budget-free compilation framework whose scoring and structure selection need only unlabeled calibration inputs. Exact Mean-FLIP scores each persistent row by the number of voxel argmax decisions that change when the row is removed from the readout; a guarded Otsu split of the log-score distribution selects the survivor count without a target and abstains when the split is unsupported; and the survivors are physically compiled into a smaller checkpoint, so camera sampling, attention, and aggregation shrink with the bank. For streaming banks, scores are integrated over each row's lifecycle through warp, death, and refill. Across four Gaussian-bank model-dataset settings and one persistent-query transfer, the automatically selected cuts remove 12-79% of eligible rows and cut bank/query-dependent latency by 7-45% across settings with component profiles, with whole-model savings of up to 8.0% on the primary endpoints bounded by fixed-cost image, voxel, and sensor modules and peak-memory savings of up to 16.6%. Under matched one-epoch recovery controls, semantic mIoU changes by at most 0.18 point. Same-$K$ controls show that the ranking, not only the bank size, matters: random removal collapses GaussianFormer-1 and OccFormer, while label-free Mean-FLIP matches or outperforms supervised Taylor ranking on all five settings where that control was run. The method applies when removable primitives keep a stable checkpoint-row identity; it is budget-free in survivor count, not parameter-free.

Abstract (translated)

URL

https://arxiv.org/abs/2610.20917

PDF

https://arxiv.org/pdf/2610.20917.pdf


Tags
3D Action Action_Localization Action_Recognition Activity Adversarial Agent Attention Autonomous Bert Boundary_Detection Caption Chat Classification CNN Compressive_Sensing Contour Contrastive_Learning Deep_Learning Denoising Detection Dialog Diffusion Drone Dynamic_Memory_Network Edge_Detection Embedding Embodied Emotion Enhancement Face Face_Detection Face_Recognition Facial_Landmark Few-Shot Gait_Recognition GAN Gaze_Estimation Gesture Gradient_Descent Handwriting Human_Parsing Image_Caption Image_Classification Image_Compression Image_Enhancement Image_Generation Image_Matting Image_Retrieval Inference Inpainting Intelligent_Chip Knowledge Knowledge_Graph Language_Model LLM Matching Medical Memory_Networks Multi_Modal Multi_Task NAS NMT Object_Detection Object_Tracking OCR Ontology Optical_Character Optical_Flow Optimization Person_Re-identification Point_Cloud Portrait_Generation Pose Pose_Estimation Prediction QA Quantitative Quantitative_Finance Quantization Re-identification Recognition Recommendation Reconstruction Regularization Reinforcement_Learning Relation Relation_Extraction Represenation Represenation_Learning Restoration Review RNN Robot Salient Scene_Classification Scene_Generation Scene_Parsing Scene_Text Segmentation Self-Supervised Semantic_Instance_Segmentation Semantic_Segmentation Semi_Global Semi_Supervised Sence_graph Sentiment Sentiment_Classification Sketch SLAM Sparse Speech Speech_Recognition Style_Transfer Summarization Super_Resolution Surveillance Survey Text_Classification Text_Generation Time_Series Tracking Transfer_Learning Transformer Unsupervised Video_Caption Video_Classification Video_Indexing Video_Prediction Video_Retrieval Visual_Relation VQA Weakly_Supervised Zero-Shot