For a compact set $K\subset\mathbb{C}$, let $\vartheta(K)$ be the infimum of the planar areas of the unit lemniscates of all monic polynomials with zeros in $K$, allowing arbitrary degree and repeated zeros. We prove that $\vartheta(K)=0$ whenever $\operatorname{cap}(K)=1$, with no regularity assumption on $K$. The proof uses a centered harmonic polynomial that is positive on all but a set of arbitrarily small area in the polynomial hull of $K$. A Fourier average of exterior harmonic measures realizes this polynomial as the logarithmic potential of a signed measure having bounded density with respect to the equilibrium measure. A positive perturbation and an $L^1$ approximation by empirical measures then produce the required polynomials. This extends the smooth-boundary result of Krishnapur, Lundberg, and Ramachandran to arbitrary compact sets of capacity one. Together with the capacity-greater-than-one theorem of Ghosh and Ramachandran and an elementary argument for unbounded sets, it follows that $\vartheta(F)=0$ for every closed infinite set $F\subset\mathbb{C}$ of transfinite diameter at least one, answering the vanishing question in Erd\H{o}s Problem 1040.
GAOKAO-Bench is introduced, an intuitive benchmark that employs questions from the Chinese GAOKAO examination as test samples, including both subjective and objective questions that contribute a robust evaluation benchmark for future large language models and offers valuable insights into the advantages and limitations of such models.
Xiaotian Zhang, Chun-yan Li, Yi Zong et al.· arXiv.org· 216 citations· ⚡17
This work investigates the possibilities of using LLMs in a resume screening setting via a document retrieval framework that simulates job candidate selection and finds that the MTEs are biased, significantly favoring White-associated names in 85% of cases and female-associated names in only 11.1% of cases.
Empirically, PRISM reduces the end-to-end time for data selection and model tuning to just 30% of conventional pipelines, and achieves this efficiency while simultaneously enhancing performance, surpassing models fine-tuned on the full dataset across eight multimodal and three language understanding benchmarks.
Jinhe Bi, Yifan Wang, Danqi Yan et al.· arXiv.org· 73 citations· ⚡4
The method, ECCOLA, is presented, which aims at making the high-level AI ethics principles more practical, making it possible for developers to more easily implement them in practice.
Ville Vakkuri, Kai-Kristian Kemell, P. Abrahamsson· EUROMICRO Conference on Soft...· 64 citations· ⚡6
This paper designs Markov decision processes (MDPs) for different combinatorial problems and proposes to train conditional GFlowNets to sample from the solution space and demonstrates that GFlowNet policies can efficiently find high-quality solutions.
Dinghuai Zhang, H. Dai, Esmeralda S. Whitammer et al.· Advances in Neural Informati...· 59 citations· ⚡8
An empirical study on the current state of practice in artificial intelligence ethics is conducted by means of a multiple case study of five case companies, which indicates a gap between research and practice in the area.
Ville Vakkuri, Kai-Kristian Kemell, Joni Kultanen et al.· arXiv.org· 56 citations· ⚡6
