Solves online 3D bin packing with deep reinforcement learning under constraints.
problem Challenges of packing items immediately without information and constraints.
method Constrained deep reinforcement learning (DRL) with feasibility predictor.
result Significantly outperforms state-of-the-art methods in online 3D bin packing.
A 3D flexible bin packing problem (3D-FBPP) arises from the process of warehouse packing in e-commerce. An online customer's order usually contains several items and needs to be packed as a whole before shipping. In particular, 5% of tens of millions of packages are using plastic wrapping as outer packaging every day, …
Bin Packing problems have been widely studied because of their broad applications in different domains. Known as a set of NP-hard problems, they have different vari- ations and many heuristics have been proposed for obtaining approximate solutions. Specifically, for the 1D variable sized bin packing problem, the two ke…
The paper studies rigidity of sphere packings on 3D manifolds with boundary.
problem Rigidity of sphere packings on 3D manifolds with boundary.
method Introduced generalized Thurston's sphere packings and proved their rigidity properties.
result Generalized Thurston's sphere packings are locally determined by combinatorial scalar curvatures and cannot be deformed while keeping combinatorial Ricci curvatures fixed.
The paper studies rigid sphere packings on 3D manifolds with boundary.
problem Investigating rigid sphere packings on 3D manifolds with boundary.
method Introducing generalized sphere packings, proving rigidity, introducing combinatorial curvature flows.
result Generalized sphere packing metrics are determined by combinatorial scalar curvature.
Heuristic algorithms such as simulated annealing, Concorde, and METIS are effective and widely used approaches to find solutions to combinatorial optimization problems. However, they are limited by the high sample complexity required to reach a reasonable solution from a cold-start. In this paper, we introduce a novel …
3D Ricci flows have bounded diameter before Type I singularities.
problem Bounding the diameter of 3D Ricci flows before Type I singularities.
method Introduced a neck-region concept and proved packing measure Ahlfors regularity.
result Uniformly bounded diameter up to Type I singular time.
Adversarial self-play in two-player games has delivered impressive results when used with reinforcement learning algorithms that combine deep neural networks and tree search. Algorithms like AlphaZero and Expert Iteration learn tabula-rasa, producing highly informative training data on the fly. However, the self-play t…
Analyzes packing of circles in bounded and unbounded planes using mathematical formulas.
problem Finding optimal radii for packing circles in various plane regions.
method Deterministic analytic formulae and recurrence relations.
result Formulated analytic formulae for 2D circle packing on various plane shapes.
This paper completes the classification of discrete conformal structures on surfaces.
problem Classifying discrete conformal structures on surfaces.
method Axiomatic approach and study of existing structures.
result Find new classes of discrete conformal structures, including generalized circle packing metrics.
Weaved helices form mechanically stable 3D structures.
problem Creating stable 3D structures from helical elements.
method Exploiting screw symmetry and invariant cylindrical rod packing to form triply periodic arrangements.
result Demonstrated nineteen triply periodic arrangements of interwoven helices.
Paper proves rigidity of discrete conformal structures on polyhedral surfaces.
problem Rigidity of discrete conformal structures on polyhedral surfaces.
method Variational principles.
result Proves Glickenstein's conjecture on the rigidity of discrete conformal structures.
Many datasets are in the form of tables of binned data. Performing regression on these data usually involves either reading off bin heights, ignoring data from neighbouring bins or interpolating between bins thus over or underestimating the true bin integrals. In this paper we propose an elegant method for performing G…
Develops Kleinian Sphere Packings and Bugs, proving their arithmetic origins.
problem Understanding sphere packings and their arithmetic origins in various dimensions.
method Introduces Kleinian Sphere Packings and Bugs, extending Arithmeticity Theorem.
result Kleinian packings and Bugs come from Q-arithmetic lattices of simplest type.
Proves rigidity of circle packings in the plane, generalizing previous work.
problem Rigidity of infinite inversive distance circle packings in the plane.
method Maximal principle for generic weighted Delaunay inversive distance circle packings and ring lemma for inversive distance circle packings in hexagonal triangulated plane.
result Proves Bowers-Stephenson's conjecture for inversive distance circle packings.
The paper studies circle packings using renormalization and subdivision rules.
problem Characterizing and proving properties of circle packings with specific subdivision rules.
method Iterations of skinning maps on Teichmüller spaces, renormalization theory, subdivision rules.
result Uniformly contracting renormalization operator and geometric inflexibility of circle packings.
Study generates infinite circle packings with a specific property.
problem Generating infinite circle packings with a unique property.
method Investigates an infinite family of circle packings and uses them to create Apollonian packings.
result Created an infinite set of circle packings with the Apollonian property.
Paper proves circle packings converge to Riemann mapping for Jordan domains.
problem Proving discrete conformal maps converge to Riemann mapping.
method Establishing solvability theorem for inversive distance circle packings.
result Bowers-Stephenson's conjecture for Jordan domains is proven.
Paper introduces new flows to find circle packings with specific curvature.
problem Finding circle packings with prescribed total geodesic curvatures.
method Introduces combinatorial Calabi flow, fractional combinatorial Calabi flow, and combinatorial p-th Calabi flow.
result Establishes conditions for the longtime behaviors of these flows.
Histogram binning method proven with guarantees without splitting data.
problem Proving theoretical guarantees for histogram binning without sample splitting.
method Using Markov property of order statistics to prove calibration guarantees for original method.
result Proves histogram binning has strong calibration guarantees without sample splitting.
Paper proves a discrete Schwarz-Pick lemma for generalized circle packings.
problem Comparing geometric quantities of circle packings with different boundary values.
method Combinatorial Calabi flows and maximum principle.
result Discrete Schwarz-Pick lemma proven for generalized circle packings.
The paper extends the Discrete Schwarz-Pick Lemma to circle packings with obtuse intersections and disjoint packings.
problem Proving the Discrete Schwarz-Pick Lemma for circle packings with various inversive distances.
method Using a variational principle for circle packings with inversive distances, the paper extends the lemma to a broader range of packings.
result The Discrete Schwarz-Pick Lemma holds for circle packings with inversive distances in (−1,1], provided an additional condition on triangle weights. Isotonic regression binning affects calibration statistics of machine learning models.
problem Isotonic regression binning introduces aleatoric uncertainty in calibration statistics.
method Calibration error statistics are recalibrated using isotonic regression, which produces stratified uncertainties.
result Stratified uncertainties lead to significant differences in bin-based calibration statistics.
The paper solves the existence problem of sphere packings in higher dimensions.
problem Existence of crystallographic sphere packings in certain higher dimensions.
method Geometric doubling procedure and computations with Lorentzian quadratic forms.
result Solves the existence problem of crystallographic sphere packings in higher dimensions.
Projective rigidity of circle packings on complex surfaces proved.
problem Proving rigidity of circle packings on complex projective surfaces.
method Proved projective rigidity through triangulations and complex projective structures.
result Space of circle packings is projectively rigid on complex projective surfaces.
Improved binning technique boosts nUV measure performance.
problem Improving the performance of the nUV measure in real applications.
method Introduced the nUV measure, provided theoretical optimal binning techniques, and proposed algorithms for approximate solutions.
result Approximate binning techniques show 4-13% increase in AUC scores with statistical significance.
Chronicals boosts LLM fine-tuning speed by 3.51x over Unsloth.
problem Memory bottleneck in fine-tuning large language models.
method Four optimizations: fused kernels, cross-entropy reduction, LoRA+, and sequence packing.
result 3.51x speedup on A100-40GB with Qwen2.5-0.5B.
Thurston's sphere packing on a 3-dimensional manifold is a generalization of Thusrton's circle packing on a surface, the rigidity of which has been open for many years. In this paper, we prove that Thurston's Euclidean sphere packing is locally determined by combinatorial scalar curvature up to scaling, which generaliz…
The paper studies circle packings on surfaces with boundary and their total geodesic curvatures.
problem Existence and rigidity of circle packings with conical singularities.
method Variational principle and combinatorial Ricci flow.
result Existence and rigidity of circle packings with prescribed total geodesic curvature.
Study of rod packings in 3-torus using 3-manifold geometry.
problem Understanding crystal structures in crystallography through rod packings in 3-torus.
method Use of 3-manifold geometry and topology to analyze complements of rod packings.
result Find families of complements that are hyperbolic and Seifert fibred.
Balls-and-Bins sampling improves DP-SGD privacy and utility.
problem Improving privacy and utility in DP-SGD implementations.
method Introducing Balls-and-Bins sampling as an alternative to shuffling in DP-SGD.
result Balls-and-Bins sampling achieves utility comparable to shuffling while offering better privacy amplification.
Paper studies degenerated circle packings in hyperbolic geometry and finds conditions for their existence.
problem Whether a prescribed total geodesic curvature can be realized by a degenerated circle packing.
method Introduced combinatorial Ricci flow to find the desired degenerated circle packed surface, analogous to Chow-Luo and Takatsu methods.
result Fully characterized sufficient and necessary conditions for the existence of degenerated circle packings and showed their uniqueness.
As neural networks are increasingly employed in machine learning practice, how to efficiently share limited training resources among a diverse set of model training tasks becomes a crucial issue. To achieve better utilization of the shared resources, we explore the idea of jointly training multiple neural network model…
Kernel sparsity ("dying ReLUs") and lack of diversity are commonly observed in CNN kernels, which decreases model capacity. Drawing inspiration from information theory and wireless communications, we demonstrate the intersection of coding theory and deep learning through the Grassmannian subspace packing problem in CNN…
Paper constructs hyperbolic metrics using circle packings and curvature parameters.
problem Creating polyhedral metrics for surfaces of various topologies.
method Using circle packings and curvature parameters, the paper constructs hyperbolic polyhedral metrics.
result Unified approach to producing polyhedral metrics for surfaces of broader topological types.
New methods reduce bias in estimating calibration error.
problem Reducing bias in estimating calibration error.
method Synthesizing model outputs and using equal-mass bins.
result Two reliable calibration-error estimators found: debiased estimator and ECE_sweep.
Study on packing links with geometric constraints.
problem Maximizing link density in space with geometric restrictions.
method Investigates packing essential links within Euclidean space.
result Upper bounds on maximal density are found, but are large.
Confirms unique eigenfunction in hyperbolic packing has maximal spectral gap.
problem Sarnak's spectral gap question for hyperbolic packings.
method Analysis of Patterson-Sullivan base eigenfunctions and spectral gaps.
result Unique square-integrable eigenfunction has maximal spectral gap.
Paper calculates ball number of links using Lorentz geometry and circle packing.
problem Calculating the minimum number of balls needed to represent a link.
method Lorentz geometry and circle packing theorem applied to ball packings.
result Shows ball(L)≤5cr(L) for any link L. The traditional Riemann Mapping Theorem can be proved with circle packing techniques. We prove the Combinatorial Riemann Mapping Theorem for tilings of bounded size using circle packings.
New theorem proves rigidity of circle packings in hyperbolic geometry.
problem Rigidity of circle packings in hyperbolic geometry.
method Established maximum principles and applied them to prove rigidity.
result Proved infinite rigidity of weighted Delaunay triangulations in the Poincaré disk.
The paper connects Apollonian packings to knot theory and improves link representations.
problem Realizing algebraic links in Apollonian packings.
method Introducing new representations of links in tangency graphs of sphere packings, proving link realizability, and improving upper bounds.
result Any algebraic link can be realized in the cubic section of the orthoplicial Apollonian packing.
Improved kernel ridge regression for large datasets using weighted random binning.
problem Efficiently approximating kernel matrices for large-scale datasets.
method Introduced weighted random binning features for locality sensitive hashing.
result Weighted random binning features generate Gaussian processes of any desired smoothness.
Paper proves rigidity of Doyle spirals in hexagonal lattice circle packings.
problem Proving Doyle conjecture for hexagonal lattice circle packings.
method Using Liouville theorem of discrete harmonic functions based on logarithmic radii ratio observation.
result Proves rigidity of Doyle spirals in hexagonal lattice circle packings with bounded radii ratios.
The paper solves circle packings on surfaces with boundaries.
problem Circle packing on surfaces with boundaries and finite genus.
method Using Thurston's algorithm and discrete Schwarz-Pick lemma.
result A unique solution to the boundary value problem exists.
The paper finds circle packings with specific curvatures in hyperbolic geometry.
problem Finding circle packings with prescribed total geodesic curvatures and discrete Gaussian curvatures.
method Established existence and rigidity via variational principle, introduced combinatorial p-th Calabi flows.
result Introduced combinatorial p-th Calabi flows to find circle packings with prescribed curvatures.
From the geometric study of the elementary cell of hexagonal circle packings --- a flower of 7 circles --- the class of conformally symmetric circle packings is defined. Up to Moebius transformations, this class is a three parameter family, that contains the famous Doyle spirals as a special case. The solutions are giv…
The optimal binning is the optimal discretization of a variable into bins given a discrete or continuous numeric target. We present a rigorous and extensible mathematical programming formulation for solving the optimal binning problem for a binary, continuous and multi-class target type, incorporating constraints not p…