Goto

Collaborating Authors

 Genre


SLIBO-Net: Floorplan Reconstruction via Slicing Box Representation with Local Geometry Regularization

Neural Information Processing Systems

This paper focuses on improving the reconstruction of 2D floorplans from unstructured 3D point clouds. We identify opportunities for enhancement over the existing methods in three main areas: semantic quality, efficient representation, and local geometric details. To address these, we presents SLIBO-Net, an innovative approach to reconstructing 2D floorplans from unstructured 3D point clouds. We propose a novel transformer-based architecture that employs an efficient floorplan representation, providing improved room shape supervision and allowing for manageable token numbers. By incorporating geometric priors as a regularization mechanism and post-processing step, we enhance the capture of local geometric details. We also propose a scale-independent evaluation metric, correcting the discrepancy in error treatment between varying floorplan sizes. Our approach notably achieves a new state-of-the-art on the Structured3D dataset. The resultant floorplans exhibit enhanced semantic plausibility, substantially improving the overall quality and realism of the reconstructions. Our code and dataset are available online1.


Retaining Beneficial Information from Detrimental Data for Deep Neural Network Repair

Neural Information Processing Systems

The performance of deep learning models heavily relies on the quality of the training data. Inadequacies in the training data, such as corrupt input or noisy labels, can lead to the failure of model generalization. Recent studies propose repairing the model by identifying the training samples that contribute to the failure and removing their influence from the model. However, it is important to note that the identified data may contain both beneficial and detrimental information. Simply erasing the information of the identified data from the model can have a negative impact on its performance, especially when accurate data is mistakenly identified as detrimental and removed.


9602d22a8c791f23f8e4d1398e3fb5be-Paper-Conference.pdf

Neural Information Processing Systems

Communication compression is a common technique in distributed optimization that can alleviate communication overhead by transmitting compressed gradients and model parameters. However, compression can introduce information distortion, which slows down convergence and incurs more communication rounds to achieve desired solutions. Given the trade-off between lower per-round communication costs and additional rounds of communication, it is unclear whether communication compression reduces the total communication cost. This paper explores the conditions under which unbiased compression, a widely used form of compression, can reduce the total communication cost, as well as the extent to which it can do so. To this end, we present the first theoretical formulation for characterizing the total communication cost in distributed optimization with unbiased compressors. We demonstrate that unbiased compression alone does not necessarily save the total communication cost, but this outcome can be achieved if the compressors used by all workers are further assumed independent. We establish lower bounds on the communication rounds required by algorithms using independent unbiased compressors to minimize smooth convex functions and show that these lower bounds are tight by refining the analysis for ADIANA. Our results reveal that using independent unbiased compression can reduce the total communication cost by a factor of up to ฮ˜( p min{n,ฮบ}) when all local smoothness constants are constrained by a common upper bound, where nis the number of workers and ฮบis the condition number of the functions being minimized. These theoretical findings are supported by experimental results.


Japan's Terra Drone expands investment in Ukraine drone sector

The Japan Times

Japan's Terra Drone expands investment in Ukraine drone sector A soldier from Ukraine's Taifun unmanned aerial vehicle unit holds a new model Marsianin attack drone on April 7 in Kharkiv region, Ukraine. Tokyo-based Terra Drone is expanding its investment in Ukrainian interceptor drones as it looks to bring battlefield-tested technology back to Japan to tap into a multibillion-dollar defense budget for unmanned systems. On Tuesday, Terra Drone CEO Toru Tokushige said the company was entering a new strategic partnership with Ukraine's WinnyLab to develop fixed-wing interceptor drones. It comes after the company announced in March that it would make an investment in Ukraine's Amazing Drones to develop vertical take-off interceptor drones. "Starting with interceptor drones we are looking for products that are good for increasing the defensive power of Ukraine and also the defensive power of Japan," Tokushige said in an interview.





Hierarchical VAEs provide a normative account of motion processing in the primate brain

Neural Information Processing Systems

The relationship between perception and inference, as postulated by Helmholtz in the 19th century, is paralleled in modern machine learning by generative models like Variational Autoencoders (VAEs) and their hierarchical variants. Here, we evaluate the role of hierarchical inference and its alignment with brain function in the domain of motion perception. We first introduce a novel synthetic data framework, Retinal Optic Flow Learning (ROFL), which enables control over motion statistics and their causes. We then present a new hierarchical VAE and test it against alternative models on two downstream tasks: (i) predicting ground truth causes of retinal optic flow (e.g., self-motion); and (ii) predicting the responses of neurons in the motion processing pathway of primates. We manipulate the model architectures (hierarchical versus non-hierarchical), loss functions, and the causal structure of the motion stimuli.



Transformer Approximations from ReLUs

arXiv.org Machine Learning

We present a systematic recipe for translating ReLU approximation results to softmax Transformers1. Given a constructive ReLU approximator for a target, we construct an explicit softmax transformer with the same accuracy. The recipe applies to many common approximation targets and yields quantitative resource bounds beyond universal approximation statements. This matters because broad Universal Approximation Properties (UAP) still dominate Transformer approximation theory. For softmax Transformer, many universality results provide explicit constructions and quantitative resource bounds (e.g., parameters, depth, width...etc) [Yun et al., 2020, Kajitsuka and Sato, 2023, Takakura and Suzuki, 2023, Jiang and Li, 2024, Hu et al., 2025,