1 citations · 4 across the 14 of their papers we have counts for
14 papers
New families of asymptotically optimal codebooks from vectorial dual-bent functions
Yadi Wei, Jiaxin Wang, Fang-Wei Fu +1
Codebooks with small maximum cross-correlation amplitudes play an important role in many applications, such as code division multiple access (CDMA) communication systems, multiple-…
Constructions and Characterizations of -Plateaued Partitions
Jiaxin Wang, Yadi Wei, Fang-Wei Fu +2
Bent partitions play a significant role in constructing bent functions and have rich connections with coding theory and combinatorics. In this paper, we introduce -plateaued par…
Further results on bent partitions
Jiaxin Wang, Yadi Wei, Fang-Wei Fu
Bent partitions of play an important role in constructing (vectorial) bent functions, partial difference sets, and association schemes, where denotes an…
Stability-based Generalization Bounds for Variational Inference
Yadi Wei, Roni Khardon
Variational inference (VI) is widely used for approximate inference in Bayesian machine learning. In addition to this practical success, generalization bounds for variational infer…
Self-orthogonal codes from plateaued functions and their applications in quantum codes and LCD codes
Yadi Wei, Jiaxin Wang, Fang-Wei Fu
Self-orthogonal codes have received great attention due to their important applications in quantum codes, LCD codes and lattices. Recently, several families of self-orthogonal code…
Association schemes arising from non-weakly regular bent functions
Yadi Wei, Jiaxin Wang, Fang-Wei Fu
Association schemes play an important role in algebraic combinatorics and have important applications in coding theory, graph theory and design theory. The methods to construct ass…
Self-Orthogonal Codes from Vectorial Dual-Bent Functions
Jiaxin Wang, Yadi Wei, Fang-Wei Fu +1
Self-orthogonal codes are a significant class of linear codes in coding theory and have attracted a lot of attention. In \cite{HLL2023Te,LH2023Se}, -ary self-orthogonal codes we…
Linear codes with few weights from non-weakly regular plateaued functions
Yadi Wei, Jiaxin Wang, Fang-Wei Fu
Linear codes with few weights have significant applications in secret sharing schemes, authentication codes, association schemes, and strongly regular graphs. There are a number of…
A Further Study of Vectorial Dual-Bent Functions
Jiaxin Wang, Fang-Wei Fu, Yadi Wei +1
Vectorial dual-bent functions have recently attracted some researchers' interest as they play a significant role in constructing partial difference sets, association schemes, bent…
Variational Inference on the Final-Layer Output of Neural Networks
Yadi Wei, Roni Khardon
Traditional neural networks are simple to train but they typically produce overconfident predictions. In contrast, Bayesian neural networks provide good uncertainty quantification…
Bent Partitions, Vectorial Dual-Bent Functions and Partial Difference Sets
Jiaxin Wang, Fang-Wei Fu, Yadi Wei
It is known that partial spreads is a class of bent partitions. In \cite{AM2022Be,MP2021Be}, two classes of bent partitions whose forms are similar to partial spreads were presente…
On the Performance of Direct Loss Minimization for Bayesian Neural Networks
Yadi Wei, Roni Khardon
Direct Loss Minimization (DLM) has been proposed as a pseudo-Bayesian method motivated as regularized loss minimization. Compared to variational inference, it replaces the loss ter…
Constructions of linear codes with two or three weights from vectorial dual-bent functions
Jiaxin Wang, Zexia Shi, Yadi Wei +1
Linear codes with a few weights are an important class of codes in coding theory and have attracted a lot of attention. In this paper, we present several constructions of -ary l…
Direct loss minimization algorithms for sparse Gaussian processes
Yadi Wei, Rishit Sheth, Roni Khardon
The paper provides a thorough investigation of Direct loss minimization (DLM), which optimizes the posterior to minimize predictive loss, in sparse Gaussian processes. For the conj…