Differentiable Packing of Irregular 3D Objects with Adaptive Container Estimation

• URL: http://arxiv.org/abs/2606.16333v2
• Date: Tue, 23 Jun 2026 09:37:12 GMT
• Title: Differentiable Packing of Irregular 3D Objects with Adaptive Container Estimation
• Abstract summary: We present a differentiable packing framework that jointly optimize all 6N object pose parameters and all three container side lengths inside a single gradient-based loop.<n>The pipeline is implemented in Python and PyTorch, with no physics engine, FFT library, or convex decomposition.<n>On multiple object categories, the method produces containers that are 11 to 32 percent smaller than time-matched DBLF and simulated-annealing baselines at N =100, while running in under 4 minutes per instance on a single consumer GPU.
• Score: 9.846019918325357
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Most existing approaches either fix the container in advance or optimize only a single container dimension through an outer search loop, leaving the remaining dimensions as a manual tuning problem. We present a differentiable packing framework that jointly optimizes all 6N object pose parameters and all three container side lengths inside a single gradient-based loop. The formulation combines six physics-inspired, differentiable loss terms computed directly on triangle meshes through axis-aligned bounding-box proxies. An adaptive squeezing mechanism periodically tightens the container whenever the overlap loss falls below a pair-count-scaled threshold, producing a large initial drop in container volume, followed by small refinements. All pairwise computations are written in tensor-broadcasting form, giving a 3.4 to 54 times speedup over a reference loop-based implementation. The pipeline is implemented in Python and PyTorch, with no physics engine, FFT library, or convex decomposition. On multiple object categories, the method produces containers that are 11 to 32 percent smaller than time-matched DBLF and simulated-annealing baselines at N =100, while running in under 4 minutes per instance on a single consumer GPU.

Related papers

• Per-Token Fixed-Point Convergence in Depth-Recurrent Transformers [0.0]
  We show a training-free rule that halts each token once its output stabilizes attains uniform depth-8 quality at 4.94 average loops.<n>A linear router trained on convergence labels harvested from the same model requires nearly full depth and yields no reduction.<n>We report average depth as a FLOP proxy with a three-point wall-clock bracket rather than a realized speedup.
  arXiv  Detail & Related papers  (2026-07-15T23:38:44Z)
• A Reproducible Software Workflow for Unanchored Approximate MUB Optimization: A Case Study in Dimension Six [5.114953719334754]
  The workflow is designed for portable execution across CPU, Apple MPS, and HPC backends.<n>We optimize unanchored configurations across 100 random seeds for basis counts n = 3, 4, 5, 6 in complex128 and complex64 arithmetic.<n>We embed the representative d = 6, n = 4 transition unitaries into three-qubit 8x8 unitaries and execute the resulting circuits on the 156-qubit Heron processor ibm-marrakesh.
  arXiv  Detail & Related papers  (2026-07-12T07:24:25Z)
• Surflo: Consistent 3D Surface Flow Model with Global State [57.57234680235885]
  Surflo decodes oriented 3D surface points by independently transporting them from noise onto the surface via flow matching.<n>To suppress the local inconsistencies inherent to independent per-point decoding, an inference-time guidance term correlates nearby points by injecting a photometric gradient.<n>Surflo matches or surpasses feed-forward baselines on surface metrics, runs an order of magnitude faster than optimization-based methods that require hundreds of views, and is the only feed-forward approach to combine a global latent with arbitrary-resolution decoding.
  arXiv  Detail & Related papers  (2026-06-11T17:48:38Z)
• Closed-Form Spectral Regularization for Multi-Task Model Merging [96.82449201305234]
  Model merging combines several independently fine-tuned experts into a single multi-task model without any training data.<n>State-of-the-art merging methods formulate merging as a layer-wise interference problem.<n>We propose SWUDI, a closed-form method that combines a soft exponential filter, which matches the gradient-flow trajectory of iterative descent.
  arXiv  Detail & Related papers  (2026-06-05T14:00:47Z)
• CART: Context-Anchored Recurrent Transformer -- A Parameter-Efficient Architecture with Learned Stability [0.0]
  CART (Context-Anchored Recurrent Transformer) is a parameter-efficient language model that reuses a single shared core block R times across depth.<n>We evaluate CART on single consumer GPUs in two stages: a 64-configuration screen at 3,000 steps, then 36 configurations (P=6, R in 6,8,10, three seeds) trained for 30,500 steps (1B tokens)<n>Two patterns hold across widths d in 256,512,768,1024: prelude depth P dominates loop count R, and the Stage-1 ranking of R reverses at full training (R=6 becomes best at
  arXiv  Detail & Related papers  (2026-05-31T23:26:27Z)
• ChunkFT: Byte-Streamed Optimization for Memory-Efficient Full Fine-Tuning [58.54940026861599]
  textscChunkFT is a memory-efficient fine-tuning framework.<n>textscChunkFT enables gradient computation for arbitrary sub-tensors without modifying the network architecture.<n>textscChunkFT consistently outperforms existing memory-efficient baselines.
  arXiv  Detail & Related papers  (2026-05-20T13:44:44Z)
• DeepShapeMatchingKit: Accelerated Functional Map Solver and Shape Matching Pipelines Revisited [48.627686484608525]
  We find that standard functional map implementations solve k independent linear systems serially, which is a computational bottleneck at higher spectral resolution.<n>We propose a vectorized reformulation that solves all systems in a single kernel call, achieving up to a 33x speedup.<n>We present an open-source, DeepShapeMatchingKit, that incorporates these improvements and standardizes training, evaluation, and data pipelines for common deep shape matching methods.
  arXiv  Detail & Related papers  (2026-04-11T23:15:07Z)
• Fast Log-Domain Sinkhorn Optimal Transport with Warp-Level GPU Reductions [1.6679662639178268]
  We present FastSinkhorn, a lightweight, native implementation of the log-domain Sinkhorn algorithm.<n>Our solver operates entirely in the log-domain, enabling computation for regularization parameters as small as epsilon = 10-4 where standard-domain methods fail.<n>We validate our solver on image color transfer, 3D point cloud matching, and convergence analysis, demonstrating that native kernels with careful numerical treatment provide a practical and efficient foundation for large-scale optimal transport.
  arXiv  Detail & Related papers  (2026-04-04T16:06:27Z)
• Scalable Mean-Variance Portfolio Optimization via Subspace Embeddings and GPU-Friendly Nesterov-Accelerated Projected Gradient [0.17188280334580197]
  We develop a sketch-based factor reduction and a Nesterov-accelerated projected gradient algorithm (NPGA) with GPU acceleration.<n>Experiments on synthetic and real equity-return data show that the method preserves objective accuracy while reducing runtime substantially.
  arXiv  Detail & Related papers  (2026-04-03T09:35:05Z)
• Breaking the Memory Barrier: Near Infinite Batch Size Scaling for Contrastive Loss [59.835032408496545]
  We propose a tile-based strategy that partitions the contrastive loss calculation into arbitrary small blocks. We also introduce a multi-level tiling strategy to leverage the hierarchical structure of distributed systems. Compared to SOTA memory-efficient solutions, it achieves a two-order-of-magnitude reduction in memory while maintaining comparable speed.
  arXiv  Detail & Related papers  (2024-10-22T17:59:30Z)
• Dynamic Convolution for 3D Point Cloud Instance Segmentation [146.7971476424351]
  We propose an approach to instance segmentation from 3D point clouds based on dynamic convolution. We gather homogeneous points that have identical semantic categories and close votes for the geometric centroids. The proposed approach is proposal-free, and instead exploits a convolution process that adapts to the spatial and semantic characteristics of each instance.
  arXiv  Detail & Related papers  (2021-07-18T09:05:16Z)
• Displacement-Invariant Cost Computation for Efficient Stereo Matching [122.94051630000934]
  Deep learning methods have dominated stereo matching leaderboards by yielding unprecedented disparity accuracy. But their inference time is typically slow, on the order of seconds for a pair of 540p images. We propose a emphdisplacement-invariant cost module to compute the matching costs without needing a 4D feature volume.
  arXiv  Detail & Related papers  (2020-12-01T23:58:16Z)
• Generalized Pose-and-Scale Estimation using 4-Point Congruence Constraints [5.063728016437489]
  gP4Pc is a new method for computing the absolute pose of a generalized camera with unknown internal scale from four corresponding 3D point-and-ray pairs. Our experiments on real and synthetic datasets, demonstrate that gP4Pc is among the fastest methods in terms of total running time when used within a SACRAN framework.
  arXiv  Detail & Related papers  (2020-11-27T16:30:19Z)

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.