Miracle-dz/UniFAR-FTUs huggingface dataset:
ON THE RATE OF CONVERGENCE OF THE BERNSTEIN-BEZIER OPERATOR

On etudie l'approximation des fonctions a variation bornee par les operateurs de Bernstein-Bezier B n (α) . Par une methode probabiliste, on obtient une estimation du reste qui fournit un ordre de convergence optimal, et qui ameliore le resultat obtenu par Fuhua Cheng [3] pour l'operateur de Bernstein B n .
Encryption with Quantum Public Keys

It is an important question to find constructions of quantum cryptographic protocols which rely on weaker computational assumptions than classical protocols. Recently, it has been shown that oblivious transfer and multi-party computation can be constructed from one-way functions, whereas this is impossible in the classical setting in a black-box way. In this work, we study the question of building quantum public-key encryption schemes from one-way functions and even weaker assumptions. Firstly, we revisit the definition of IND-CPA security to this setting. Then, we propose three schemes for quantum public-key encryption from one-way functions, pseudorandom function-like states with proof of deletion and pseudorandom function-like states, respectively.
MaskDiff: Modeling Mask Distribution with Diffusion Probabilistic Model for Few-Shot Instance Segmentation

Few-shot instance segmentation extends the few-shot learning paradigm to the instance segmentation task, which tries to segment instance objects from a query image with a few annotated examples of novel categories. Conventional approaches have attempted to address the task via prototype learning, known as point estimation. However, this mechanism depends on prototypes (e.g. mean of K-shot) for prediction, leading to performance instability. To overcome the disadvantage of the point estimation mechanism, we propose a novel approach, dubbed MaskDiff, which models the underlying conditional distribution of a binary mask, which is conditioned on an object region and K-shot information. Inspired by augmentation approaches that perturb data with Gaussian noise for populating low data density regions, we model the mask distribution with a diffusion probabilistic model. We also propose to utilize classifier-free guided mask sampling to integrate category information into the binary mask generation process. Without bells and whistles, our proposed method consistently outperforms state-of-the-art methods on both base and novel classes of the COCO dataset while simultaneously being more stable than existing methods. The source code is available at: https://github.com/minhquanlecs/MaskDiff.
The first coefficient of Langlands Eisenstein series for ${\rm SL}(n,\mathbb Z)$

Fourier coefficients of Eisenstein series figure prominently in the study of automorphic L-functions via the Langlands-Shahidi method, and in various other aspects of the theory of automorphic forms and representations. In this paper, we define Langlands Eisenstein series for ${\rm SL}(n,\mathbb Z)$ in an elementary manner, and then determine the first Fourier coefficient of these series in a very explicit form. Our proofs and derivations are short and simple, and use the Borel Eisenstein series as a template to determine the first Fourier coefficient of other Langlands Eisenstein series.
Modeling the vertical motion of drops bouncing on a bounded fluid reservoir

We present a first-principles model of drops bouncing on a liquid reservoir. We consider a nearly inviscid liquid reservoir and track the waves that develop in a bounded domain. Bouncing drops are modeled as vertical linear springs. We obtain an expression for the contact force between drop and liquid surface and a model where the only adjustable parameter is an effective viscosity used to describe the waves on the reservoir’s surface. With no adjustable parameters associated to the drop, we recover experimental bouncing times and restitution coefficients. We use our model to describe the effect of the Bond, Ohnesorge, and Weber numbers on drops bouncing on a stationary reservoir. We also use our model to describe drops bouncing on an oscillated reservoir, describing various bouncing modes and a walking threshold.
Rethinking Self-Supervised Visual Representation Learning in Pre-training for 3D Human Pose and Shape Estimation

Recently, a few self-supervised representation learning (SSL) methods have outperformed the ImageNet classification pre-training for vision tasks such as object detection. However, its effects on 3D human body pose and shape estimation (3DHPSE) are open to question, whose target is fixed to a unique class, the human, and has an inherent task gap with SSL. We empirically study and analyze the effects of SSL and further compare it with other pre-training alternatives for 3DHPSE. The alternatives are 2D annotation-based pre-training and synthetic data pre-training, which share the motivation of SSL that aims to reduce the labeling cost. They have been widely utilized as a source of weak-supervision or fine-tuning, but have not been remarked as a pre-training source. SSL methods underperform the conventional ImageNet classification pre-training on multiple 3DHPSE benchmarks by 7.7% on average. In contrast, despite a much less amount of pre-training data, the 2D annotation-based pre-training improves accuracy on all benchmarks and shows faster convergence during fine-tuning. Our observations challenge the naive application of the current SSL pre-training to 3DHPSE and relight the value of other data types in the pre-training aspect.
Channel and shoal development in a short tidal embayment: an idealized model study

In many tidal embayments, complex patterns of channels and shoals are observed. To gain a better understanding of these features, an idealized model, that describes the interaction of water motion, sediment transport and bed evolution in a semi-enclosed, rectangular basin, is developed and analysed. To explain the initial formation of channels and shoals, two-dimensional perturbations superposed on a laterally uniform equilibrium bottom are studied. These perturbations evolve due to convergences of various residual suspended sediment fluxes: a diffusive flux, a flux related to the bed topography, an advective flux resulting from internally generated overtides and an advective flux due to externally prescribed overtides. For most combinations of these fluxes, perturbations start to grow if the bottom friction is strong enough. Their growth is mainly a result of convergences of diffusive and topographically induced sediment fluxes. Advective contributions due to internally generated overtides enhance this growth. If only diffusive sediment fluxes are considered, the underlying equilibrium is always unstable. This can be traced back to the depth dependence of the deposition parameter. Contrary to the results of previous idealized models, the channels and shoals always initiate in the shallow, landward areas. This is explained by the enhanced generation (compared to that in previous models) of frictional torques in shallow regions. The resulting initial channel–shoal formation compares well with results found in complex numerical model studies. The instability mechanism and the location of the initial formation of bottom patterns do not change qualitatively when varying parameters. Changes are mainly related to differences in the underlying equilibrium profile due to parameter variations.
Analysis and optimization of a multicascade method for the size fractionation of poly-dispersed particle systems via sedimentation or centrifugation

Sedimentation and centrifugation can be used to sort particles by size, using a multistep (multicascade) method in which particles in the sediment are removed and the content of the supernatant is processed again, repeating the cycle several times. This paper proposes a theoretical analysis of this process, based on a one-dimensional model, with a view to identify parameters that are optimal to obtain a relatively monodispersed suspension, starting from a log-normal particle size distribution. We found that a rational choice of the sedimentation/centrifugation time enables to control the amount of particles outside of the desired size range (impurities). Surprisingly, the multistep method does not converge, as multiple steps are worse than 2 steps. Band sedimentation, in which a particle-rich layer is overlaid on clear fluid, offers substantial benefits in terms of impurity reduction with respect to starting from a completely mixed situation. An application to graphene fractionation is discussed.
M-Tuning: Prompt Tuning with Mitigated Label Bias in Open-Set Scenarios

In realistic open-set scenarios where labels of a part of testing data are totally unknown, when vision-language (VL) prompt learning methods encounter inputs related to unknown classes (i.e., not seen during training), they always predict them as one of the training classes. The exhibited label bias causes difficulty in open set recognition (OSR), in which an image should be correctly predicted as one of the known classes or the unknown one. To achieve this goal, we propose a vision-language prompt tuning method with mitigated label bias (M-Tuning). It introduces open words from the WordNet to extend the range of words forming the prompt texts from only closed-set label words to more, and thus prompts are tuned in a simulated open-set scenario. Besides, inspired by the observation that classifying directly on large datasets causes a much higher false positive rate than on small datasets, we propose a Combinatorial Tuning and Testing (CTT) strategy for improving performance. CTT decomposes M-Tuning on large datasets as multiple independent group-wise tuning on fewer classes, then makes accurate and comprehensive predictions by selecting the optimal sub-prompt. Finally, given the lack of VL-based OSR baselines in the literature, especially for prompt methods, we contribute new baselines for fair comparisons. Our method achieves the best performance on datasets with various scales, and extensive ablation studies also validate its effectiveness.
Preferences and Attitudes towards Debt Collection: A Cross-Generational Investigation

Preliminary research indicated that an increasing number of young adults end up in debt collection. Yet, debt collection agencies (DCAs) are still lacking knowledge on how to approach these consumers. A large-scale mixed-methods survey of consumers in Germany (N = 996) was conducted to investigate preference shifts from traditional to digital payment, and communication channels; and attitude shifts towards financial institutions. Our results show that, indeed, younger consumers are more likely to prefer digital payment methods (e.g., Paypal, Apple Pay), while older consumers are more likely to prefer traditional payment methods such as manual transfer. In the case of communication channels, we found that older consumers were more likely to prefer letters than younger consumers. Additional factors that had an influence on payment and communication preferences include gender, income and living in an urban area. Finally, we observed attitude shifts of younger consumers by exhibiting more openness when talking about their debt than older consumers. In summary, our findings show that consumers' preferences are influenced by individual differences, specifically age, and we discuss how DCAs can leverage these insights to optimize their processes.
Learning Strategic Value and Cooperation in Multi-Player Stochastic Games through Side Payments

For general-sum, n-player, strategic games with transferable utility, the Harsanyi-Shapley value provides a computable method to both 1) quantify the strategic value of a player; and 2) make cooperation rational through side payments. We give a simple formula to compute the HS value in normal-form games. Next, we provide two methods to generalize the HS values to stochastic (or Markov) games, and show that one of them may be computed using generalized Q-learning algorithms. Finally, an empirical validation is performed on stochastic grid-games with three or more players. Source code is provided to compute HS values for both the normal-form and stochastic game setting.
Graphically discrete groups and rigidity

We introduce the notion of graphical discreteness to group theory. A finitely generated group is graphically discrete if whenever it acts geometrically on a locally finite graph, the automorphism group of the graph is compact-by-discrete. Notable examples include finitely generated nilpotent groups, most lattices in semisimple Lie groups, and irreducible non-geometric 3-manifold groups. We show graphs of groups with graphically discrete vertex groups frequently have strong rigidity properties. We prove free products of one-ended virtually torsion-free graphically discrete groups are action rigid within the class of virtually torsion-free groups. We also prove quasi-isometric rigidity for many hyperbolic graphs of groups whose vertex groups are closed hyperbolic manifold groups and whose edge groups are non-elementary quasi-convex subgroups. This includes the case of two hyperbolic 3-manifold groups amalgamated along a quasi-convex malnormal non-abelian free subgroup. We provide several additional examples of graphically discrete groups and illustrate this property is not a commensurability invariant.
Penalized Deep Partially Linear Cox Models with Application to CT Scans of Lung Cancer Patients

Lung cancer is a leading cause of cancer mortality globally, highlighting the importance of understanding its mortality risks to design effective patient-centered therapies. The National Lung Screening Trial (NLST) employed computed tomography texture analysis, which provides objective measurements of texture patterns on CT scans, to quantify the mortality risks of lung cancer patients. Partially linear Cox models have gained popularity for survival analysis by dissecting the hazard function into parametric and nonparametric components, allowing for the effective incorporation of both well-established risk factors (such as age and clinical variables) and emerging risk factors (eg, image features) within a unified framework. However, when the dimension of parametric components exceeds the sample size, the task of model fitting becomes formidable, while nonparametric modeling grapples with the curse of dimensionality. We propose a novel Penalized Deep Partially Linear Cox Model (Penalized DPLC), which incorporates the smoothly clipped absolute deviation (SCAD) penalty to select important texture features and employs a deep neural network to estimate the nonparametric component of the model. We prove the convergence and asymptotic properties of the estimator and compare it to other methods through extensive simulation studies, evaluating its performance in risk prediction and feature selection. The proposed method is applied to the NLST study dataset to uncover the effects of key clinical and imaging risk factors on patients' survival. Our findings provide valuable insights into the relationship between these factors and survival outcomes.
M3AE: Multimodal Representation Learning for Brain Tumor Segmentation with Missing Modalities

Multimodal magnetic resonance imaging (MRI) provides complementary information for sub-region analysis of brain tumors. Plenty of methods have been proposed for automatic brain tumor segmentation using four common MRI modalities and achieved remarkable performance. In practice, however, it is common to have one or more modalities missing due to image corruption, artifacts, acquisition protocols, allergy to contrast agents, or simply cost. In this work, we propose a novel two-stage framework for brain tumor segmentation with missing modalities. In the first stage, a multimodal masked autoencoder (M3AE) is proposed, where both random modalities (i.e., modality dropout) and random patches of the remaining modalities are masked for a reconstruction task, for self-supervised learning of robust multimodal representations against missing modalities. To this end, we name our framework M3AE. Meanwhile, we employ model inversion to optimize a representative full-modal image at marginal extra cost, which will be used to substitute for the missing modalities and boost performance during inference. Then in the second stage, a memory-efficient self distillation is proposed to distill knowledge between heterogenous missing-modal situations while fine-tuning the model for supervised segmentation. Our M3AE belongs to the ‘catch-all’ genre where a single model can be applied to all possible subsets of modalities, thus is economic for both training and deployment. Extensive experiments on BraTS 2018 and 2020 datasets demonstrate its superior performance to existing state-of-the-art methods with missing modalities, as well as the efficacy of its components. Our code is available at: https://github.com/ccarliu/m3ae.
Topological Generality and Spectral Dimensionality in the Earth Mineral Dust Source Investigation (EMIT) Using Joint Characterization and the Spectral Mixture Residual

NASA’s Earth Surface Mineral Dust Source Investigation (EMIT) mission seeks to use spaceborne imaging spectroscopy (hyperspectral imaging) to map the mineralogy of arid dust source regions. Here we apply recent developments in Joint Characterization (JC) and the spectral Mixture Residual (MR) to explore the information content of data from this novel mission. Specifically, for a mosaic of 20 spectrally diverse scenes, we find: (1) a generalized three-endmember (Substrate, Vegetation, Dark; SVD) spectral mixture model is capable of capturing the preponderance (99% in three dimensions) of spectral variance with low misfit (99% pixels with <3.7% RMSE); (2) manifold learning (UMAP) is capable of identifying spatially coherent, physically interpretable clustering relationships in the spectral feature space; (3) UMAP yields results that are at least as informative when applied to the MR as when applied to raw reflectance; (4) SVD fraction information usefully contextualizes UMAP clustering relationships, and vice-versa (JC); and (5) when EMIT data are convolved to spectral response functions of multispectral instruments (Sentinel-2, Landsat 8/9, Planet SuperDove), SVD fractions correlate strongly across sensors, but UMAP clustering relationships for the EMIT hyperspectral feature space are far more informative than for simulated multispectral sensors. Implications are discussed for both the utility of EMIT data in the near-term and for the potential of high signal-to-noise (SNR) spaceborne imaging spectroscopy more generally, to transform the future of optical remote sensing in the years and decades to come.
Spawrious: A Benchmark for Fine Control of Spurious Correlation Biases

The problem of spurious correlations (SCs) arises when a classifier relies on non-predictive features that happen to be correlated with the labels in the training data. For example, a classifier may misclassify dog breeds based on the background of dog images. This happens when the backgrounds are correlated with other breeds in the training data, leading to misclassifications during test time. Previous SC benchmark datasets suffer from varying issues, e.g., over-saturation or only containing one-to-one (O2O) SCs, but no many-to-many (M2M) SCs arising between groups of spurious attributes and classes. In this paper, we present \benchmark-\{O2O, M2M\}-\{Easy, Medium, Hard\}, an image classification benchmark suite containing spurious correlations between classes and backgrounds. To create this dataset, we employ a text-to-image model to generate photo-realistic images and an image captioning model to filter out unsuitable ones. The resulting dataset is of high quality and contains approximately 152k images. Our experimental results demonstrate that state-of-the-art group robustness methods struggle with \benchmark, most notably on the Hard-splits with none of them getting over $70\%$ accuracy on the hardest split using a ResNet50 pretrained on ImageNet. By examining model misclassifications, we detect reliances on spurious backgrounds, demonstrating that our dataset provides a significant challenge.
Data-dependent Generalization Bounds via Variable-Size Compressibility

In this paper, we establish novel data-dependent upper bounds on the generalization error through the lens of a"variable-size compressibility"framework that we introduce newly here. In this framework, the generalization error of an algorithm is linked to a variable-size 'compression rate' of its input data. This is shown to yield bounds that depend on the empirical measure of the given input data at hand, rather than its unknown distribution. Our new generalization bounds that we establish are tail bounds, tail bounds on the expectation, and in-expectations bounds. Moreover, it is shown that our framework also allows to derive general bounds on any function of the input data and output hypothesis random variables. In particular, these general bounds are shown to subsume and possibly improve over several existing PAC-Bayes and data-dependent intrinsic dimension-based bounds that are recovered as special cases, thus unveiling a unifying character of our approach. For instance, a new data-dependent intrinsic dimension-based bound is established, which connects the generalization error to the optimization trajectories and reveals various interesting connections with the rate-distortion dimension of a process, the R\'enyi information dimension of a process, and the metric mean dimension.
3DGen: Triplane Latent Diffusion for Textured Mesh Generation

Latent diffusion models for image generation have crossed a quality threshold which enabled them to achieve mass adoption. Recently, a series of works have made advancements towards replicating this success in the 3D domain, introducing techniques such as point cloud VAE, triplane representation, neural implicit surfaces and differentiable rendering based training. We take another step along this direction, combining these developments in a two-step pipeline consisting of 1) a triplane VAE which can learn latent representations of textured meshes and 2) a conditional diffusion model which generates the triplane features. For the first time this architecture allows conditional and unconditional generation of high quality textured or untextured 3D meshes across multiple diverse categories in a few seconds on a single GPU. It outperforms previous work substantially on image-conditioned and unconditional generation on mesh quality as well as texture generation. Furthermore, we demonstrate the scalability of our model to large datasets for increased quality and diversity. We will release our code and trained models.
TANGOS: Regularizing Tabular Neural Networks through Gradient Orthogonalization and Specialization

Despite their success with unstructured data, deep neural networks are not yet a panacea for structured tabular data. In the tabular domain, their efficiency crucially relies on various forms of regularization to prevent overfitting and provide strong generalization performance. Existing regularization techniques include broad modelling decisions such as choice of architecture, loss functions, and optimization methods. In this work, we introduce Tabular Neural Gradient Orthogonalization and Specialization (TANGOS), a novel framework for regularization in the tabular setting built on latent unit attributions. The gradient attribution of an activation with respect to a given input feature suggests how the neuron attends to that feature, and is often employed to interpret the predictions of deep networks. In TANGOS, we take a different approach and incorporate neuron attributions directly into training to encourage orthogonalization and specialization of latent attributions in a fully-connected network. Our regularizer encourages neurons to focus on sparse, non-overlapping input features and results in a set of diverse and specialized latent units. In the tabular domain, we demonstrate that our approach can lead to improved out-of-sample generalization performance, outperforming other popular regularization methods. We provide insight into why our regularizer is effective and demonstrate that TANGOS can be applied jointly with existing methods to achieve even greater generalization performance.