Goto

Collaborating Authors

 Asia



Neural Unsigned Distance Fields for Implicit Function Learning JulianChibane AymenMir GerardPons-Moll Max Planck Institute for Informatics, Saarland Informatics Campus, Germany

Neural Information Processing Systems

In this work we target a learnableoutputrepresentation that allows continuous, high resolution outputs of arbitrary shape. Recent works represent 3D surfaces implicitly with a Neural Network, thereby breaking previous barriers in resolution, and ability to represent diverse topologies. However, neural implicit representations arelimited to closed surfaces, which divide the space into inside and outside. Many real world objects such as walls of a scene scannedby a sensor,clothing,or a car with innerstructuresare not closed. Thisconstitutesa significant barrier,in termsof datapre-processing (objects need to be artificially closed creating artifacts), and the ability to output open surfaces. In this work, we proposeNeural Distance Fields (NDF), a neural network based model which predicts the unsigned distance field for arbitrary 3D shapes given sparse point clouds. NDF represent surfaces at high resolutions as prior implicit models, but do not require closed surface data, and significantly broaden the class of representable shapes in the output.




Combinatorial Pure Exploration with Bottleneck Reward Function

Neural Information Processing Systems

In this paper, we study the Combinatorial Pure Exploration problem with the Bottleneck reward function (CPE-B) under the fixed-confidence (FC) and fixed-budget (FB) settings.



Towards Combating Frequency Simplicity-biased Learning for Domain Generalization Xilin He

Neural Information Processing Systems

Domain generalization methods aim to learn transferable knowledge from source domains that can generalize well to unseen target domains. Recent studies show that neural networks frequently suffer from a simplicity-biased learning behavior which leads to over-reliance on specific frequency sets, namely as frequency shortcuts, instead of semantic information, resulting in poor generalization performance. Despite previous data augmentation techniques successfully enhancing generalization performances, they intend to apply more frequency shortcuts, thereby causing hallucinations of generalization improvement. In this paper, we aim to prevent such learning behavior of applying frequency shortcuts from a data-driven perspective. Given the theoretical justification of models' biased learning behavior on different spatial frequency components, which is based on the dataset frequency properties, we argue that the learning behavior on various frequency components could be manipulated by changing the dataset statistical structure in the Fourier domain. Intuitively, as frequency shortcuts are hidden in the dominant and highly dependent frequencies of dataset structure, dynamically pertur-bating the over-reliance frequency components could prevent the application of frequency shortcuts. To this end, we propose two effective data augmentation modules designed to collaboratively and adaptively adjust the frequency characteristic of the dataset, aiming to dynamically influence the learning behavior of the model and ultimately serving as a strategy to mitigate shortcut learning. Code is available at AdvFrequency .