arXiv (Cornell University)最新文献

Plane partitions and rowmotion on rectangular and trapezoidal posets 平面分区和在矩形和梯形上的移动

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07133

Johnson, Joseph, Liu, Ricky Ini

引用次数: 0

WaterBench: Towards Holistic Evaluation of Watermarks for Large Language Models WaterBench:迈向大型语言模型水印的整体评估

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07138

Tu, Shangqing, Sun, Yuliang, Bai, Yushi, Yu, Jifan, Hou, Lei, Li, Juanzi

{"title":"WaterBench: Towards Holistic Evaluation of Watermarks for Large Language\u0000 Models","authors":"Tu, Shangqing, Sun, Yuliang, Bai, Yushi, Yu, Jifan, Hou, Lei, Li, Juanzi","doi":"10.48550/arxiv.2311.07138","DOIUrl":"https://doi.org/10.48550/arxiv.2311.07138","url":null,"abstract":"To mitigate the potential misuse of large language models (LLMs), recent research has developed watermarking algorithms, which restrict the generation process to leave an invisible trace for watermark detection. Due to the two-stage nature of the task, most studies evaluate the generation and detection separately, thereby presenting a challenge in unbiased, thorough, and applicable evaluations. In this paper, we introduce WaterBench, the first comprehensive benchmark for LLM watermarks, in which we design three crucial factors: (1) For textbf{benchmarking procedure}, to ensure an apples-to-apples comparison, we first adjust each watermarking method's hyper-parameter to reach the same watermarking strength, then jointly evaluate their generation and detection performance. (2) For textbf{task selection}, we diversify the input and output length to form a five-category taxonomy, covering $9$ tasks. (3) For textbf{evaluation metric}, we adopt the GPT4-Judge for automatically evaluating the decline of instruction-following abilities after watermarking. We evaluate $4$ open-source watermarks on $2$ LLMs under $2$ watermarking strengths and observe the common struggles for current methods on maintaining the generation quality. The code and data are available at url{https://github.com/THU-KEG/WaterBench}.","PeriodicalId":496270,"journal":{"name":"arXiv (Cornell University)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136352299","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Analyzing and Predicting Low-Listenership Trends in a Large-Scale Mobile Health Program: A Preliminary Investigation 分析和预测大规模移动医疗计划的低听众趋势:初步调查

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07139

Lalan, Arshika, Verma, Shresth, Sudan, Kumar Madhu, Mahale, Amrita, Hegde, Aparna, Tambe, Milind, Taneja, Aparna

{"title":"Analyzing and Predicting Low-Listenership Trends in a Large-Scale Mobile\u0000 Health Program: A Preliminary Investigation","authors":"Lalan, Arshika, Verma, Shresth, Sudan, Kumar Madhu, Mahale, Amrita, Hegde, Aparna, Tambe, Milind, Taneja, Aparna","doi":"10.48550/arxiv.2311.07139","DOIUrl":"https://doi.org/10.48550/arxiv.2311.07139","url":null,"abstract":"Mobile health programs are becoming an increasingly popular medium for dissemination of health information among beneficiaries in less privileged communities. Kilkari is one of the world's largest mobile health programs which delivers time sensitive audio-messages to pregnant women and new mothers. We have been collaborating with ARMMAN, a non-profit in India which operates the Kilkari program, to identify bottlenecks to improve the efficiency of the program. In particular, we provide an initial analysis of the trajectories of beneficiaries' interaction with the mHealth program and examine elements of the program that can be potentially enhanced to boost its success. We cluster the cohort into different buckets based on listenership so as to analyze listenership patterns for each group that could help boost program success. We also demonstrate preliminary results on using historical data in a time-series prediction to identify beneficiary dropouts and enable NGOs in devising timely interventions to strengthen beneficiary retention.","PeriodicalId":496270,"journal":{"name":"arXiv (Cornell University)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136352302","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Performance Analysis of Integrated Data and Energy Transfer Assisted by Fluid Antenna Systems 流体天线系统辅助下集成数据和能量传递的性能分析

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07134

Lin, Xiao, Yang, Halvin, Zhao, Yizhe, Hu, Jie, Wong, Kai-Kit

{"title":"Performance Analysis of Integrated Data and Energy Transfer Assisted by\u0000 Fluid Antenna Systems","authors":"Lin, Xiao, Yang, Halvin, Zhao, Yizhe, Hu, Jie, Wong, Kai-Kit","doi":"10.48550/arxiv.2311.07134","DOIUrl":"https://doi.org/10.48550/arxiv.2311.07134","url":null,"abstract":"Fluid antenna multiple access (FAMA) is capable of exploiting the high spatial diversity of wireless channels to mitigate multi-user interference via flexible port switching, which achieves a better performance than traditional multi-input-multi-output (MIMO) systems. Moreover, integrated data and energy transfer (IDET) is able to provide both the wireless data transfer (WDT) and wireless energy transfer (WET) services towards low-power devices. In this paper, a FAMA assisted IDET system is studied, where $N$ access points (APs) provide dedicated IDET services towards $N$ user equipments (UEs). Each UE is equipped with a single fluid antenna. The performance of WDT and WET , textit{i.e.}, the WDT outage probability, the WET outage probability, the reliable throughput and the average energy harvesting amount, are analysed theoretically by using time switching (TS) between WDT and WET. Numerical results validate our theoretical analysis, which reveals that the number of UEs and TS ratio should be optimized to achieve a trade-off between the WDT and WET performance. Moreover, FAMA assisted IDET achieves a better performance in terms of both WDT and WET than traditional MIMO with the same antenna size.","PeriodicalId":496270,"journal":{"name":"arXiv (Cornell University)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136352303","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Decision-making under risk: when is utility maximization equivalent to risk minimization? 风险下的决策:效用最大化何时等于风险最小化?

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07269

Ruscitti, Francesco, Dubey, Ram Sewak, Laguzzi, Giorgio

引用次数: 0

Dynamic Optimization on Quantum Hardware: Feasibility for a Process Industry Use Case 量子硬件的动态优化:过程工业用例的可行性

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07310

Nenno, Dennis Michael, Caspari, Adrian

{"title":"Dynamic Optimization on Quantum Hardware: Feasibility for a Process\u0000 Industry Use Case","authors":"Nenno, Dennis Michael, Caspari, Adrian","doi":"10.48550/arxiv.2311.07310","DOIUrl":"https://doi.org/10.48550/arxiv.2311.07310","url":null,"abstract":"The quest for real-time dynamic optimization solutions in the process industry represents a formidable computational challenge, particularly within the realm of applications like model predictive control where rapid and reliable computations are critical. Conventional methods can struggle to surmount the complexities of such tasks. Quantum computing and quantum annealing emerge as avant-garde contenders to transcend conventional computational constraints. We convert a dynamic optimization problem, characterized by a system of differential equations, into a Quadratic Unconstrained Binary Optimization problem, enabling quantum computational approaches. The empirical findings synthesized from classical methods, simulated annealing, quantum annealing via D-Wave's quantum annealer, and hybrid solver methodologies, illuminate the intricate landscape of computational prowess essential for tackling complex and high-dimensional dynamic optimization problems. Our findings suggest that while quantum annealing is a maturing technology that currently does not outperform state-of-the-art classical solvers, continuous improvements could eventually aid in increasing efficiency within the chemical process industry.","PeriodicalId":496270,"journal":{"name":"arXiv (Cornell University)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136352320","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A Bayesian Approach to Strong Lens Finding in the Era of Wide-area Surveys 广域观测时代强透镜发现的贝叶斯方法

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07455

Holloway, Philip, Marshall, Philip J., Verma, Aprajita, More, Anupreeta, Cañameras, Raoul, Jaelani, Anton T., Ishida, Yuichiro, Wong, Kenneth C.

{"title":"A Bayesian Approach to Strong Lens Finding in the Era of Wide-area\u0000 Surveys","authors":"Holloway, Philip, Marshall, Philip J., Verma, Aprajita, More, Anupreeta, Cañameras, Raoul, Jaelani, Anton T., Ishida, Yuichiro, Wong, Kenneth C.","doi":"10.48550/arxiv.2311.07455","DOIUrl":"https://doi.org/10.48550/arxiv.2311.07455","url":null,"abstract":"The arrival of the Vera C. Rubin Observatory's Legacy Survey of Space and Time (LSST), Euclid-Wide and Roman wide area sensitive surveys will herald a new era in strong lens science in which the number of strong lenses known is expected to rise from $mathcal{O}(10^3)$ to $mathcal{O}(10^5)$. However, current lens-finding methods still require time-consuming follow-up visual inspection by strong-lens experts to remove false positives which is only set to increase with these surveys. In this work we demonstrate a range of methods to produce calibrated probabilities to help determine the veracity of any given lens candidate. To do this we use the classifications from citizen science and multiple neural networks for galaxies selected from the Hyper Suprime-Cam (HSC) survey. Our methodology is not restricted to particular classifier types and could be applied to any strong lens classifier which produces quantitative scores. Using these calibrated probabilities, we generate an ensemble classifier, combining citizen science and neural network lens finders. We find such an ensemble can provide improved classification over the individual classifiers. We find a false positive rate of $10^{-3}$ can be achieved with a completeness of $46%$, compared to $34%$ for the best individual classifier. Given the large number of galaxy-galaxy strong lenses anticipated in LSST, such improvement would still produce significant numbers of false positives, in which case using calibrated probabilities will be essential for population analysis of large populations of lenses.","PeriodicalId":496270,"journal":{"name":"arXiv (Cornell University)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136352341","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Translational symmetry broken magnetization plateau of the S=1 antiferromagnetic Heisenberg chain with competing anisotropies 具有竞争各向异性的S=1反铁磁海森堡链的平移对称性破缺磁化平台

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07123

Sakai, Tôru, Okamoto, Kiyomi, Okunishi, Kouichi, Hashimoto, Masaru, Houda, Tomoki, Furuchi, Rito, Nakano, Hiroki

引用次数: 0

Reconfiguration of basis pairs in regular matroids 正则拟阵中基对的重构

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07130

Bérczi, Kristóf, Mátravölgyi, Bence, Schwarcz, Tamás

{"title":"Reconfiguration of basis pairs in regular matroids","authors":"Bérczi, Kristóf, Mátravölgyi, Bence, Schwarcz, Tamás","doi":"10.48550/arxiv.2311.07130","DOIUrl":"https://doi.org/10.48550/arxiv.2311.07130","url":null,"abstract":"In recent years, combinatorial reconfiguration problems have attracted great attention due to their connection to various topics such as optimization, counting, enumeration, or sampling. One of the most intriguing open questions concerns the exchange distance of two matroid basis sequences, a problem that appears in several areas of computer science and mathematics. In 1980, White proposed a conjecture for the characterization of two basis sequences being reachable from each other by symmetric exchanges, which received a significant interest also in algebra due to its connection to toric ideals and Gr\"obner bases. In this work, we verify White's conjecture for basis sequences of length two in regular matroids, a problem that was formulated as a separate question by Farber, Richter, and Shan and Andres, Hochst\"attler, and Merkel. Most of previous work on White's conjecture has not considered the question from an algorithmic perspective. We study the problem from an optimization point of view: our proof implies a polynomial algorithm for determining a sequence of symmetric exchanges that transforms a basis pair into another, thus providing the first polynomial upper bound on the exchange distance of basis pairs in regular matroids. As a byproduct, we verify a conjecture of Gabow from 1976 on the serial symmetric exchange property of matroids for the regular case.","PeriodicalId":496270,"journal":{"name":"arXiv (Cornell University)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-11-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136352464","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Gen-Z: Generative Zero-Shot Text Classification with Contextualized Label Descriptions Gen-Z:基于语境化标签描述的生成零射击文本分类

arXiv (Cornell University) Pub Date : 2023-11-13 DOI: 10.48550/arxiv.2311.07115

Kumar, Sachin, Park, Chan Young, Tsvetkov, Yulia

引用次数: 0