检索结果-内蒙古大学图书馆

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Feldman, Shai Romano, Yaniv Department of Computer Science Technion Israel Departments of Electrical and Computer Engineering and of Computer Science Technion Israel

We develop a method to generate prediction sets with a guaranteed coverage rate that is robust to corruptions in the training data, such as missing or noisy variables. Our approach builds on conformal prediction, a powerful framework to construct prediction sets that are valid under the i.i.d assumption. Importantly, naively applying conformal prediction does not provide reliable predictions in this setting, due to the distribution shift induced by the corruptions. To account for the distribution shift, we assume access to privileged information (PI). The PI is formulated as additional features that explain the distribution shift, however, they are only available during training and absent at test time. We approach this problem by introducing a novel generalization of weighted conformal prediction and support our method with theoretical coverage guarantees. Empirical experiments on both real and synthetic datasets indicate that our approach achieves a valid coverage rate and constructs more informative predictions compared to existing methods, which are not supported by theoretical guarantees. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Learned, uncertainty-driven adaptive acquisition for photon-efficient scanning microscopy

引用

Optics Express 2025年第6期33卷 12269-12287页

作者： Ye, Cassandra Tong Han, Jiashu Liu, Kunzan Angelopoulos, Anastasios Griffith, Linda Monakhova, Kristina You, Sixian The Department of Electrical Engineering and Computer Science CambridgeMA02139 United States Fu Foundation School of Engineering and Applied Science Columbia University in The City of New York New YorkNY10027 United States University of California Berkeley Department of Electrical Engineering and Computer Science BerkeleyCA94720 United States Department of Biological Engineering Massachusetts Institute of Technology CambridgeMA02139 United States

Scanning microscopy systems, such as confocal and multiphoton microscopy, are powerful imaging tools for probing deep into biological tissue. However, scanning systems have an inherent trade-off between acquisition time, field of view, phototoxicity, and image quality. This often results in noisy measurements when fast, large field of view, and/or gentle imaging is needed. Deep learning could be used to denoise noisy microscopy measurements, but these algorithms can be prone to hallucination, which can be disastrous for medical and scientific applications. We propose a method to simultaneously denoise and predict pixel-wise uncertainty for scanning microscopy systems, improving algorithm trustworthiness and providing statistical guarantees for deep learning predictions. Furthermore, we propose to leverage this learned, pixel-wise uncertainty to drive an adaptive acquisition technique that rescans only the most uncertain regions of a sample, saving time and reducing the total light dose to the sample. We demonstrate our method on experimental confocal and multiphoton microscopy systems, showing that our uncertainty maps can pinpoint hallucinations in the deep learned predictions. Finally, with our adaptive acquisition technique, we demonstrate up to 16× reduction in acquisition time and total light dose while successfully recovering fine features in the sample and reducing hallucinations. We are the first to demonstrate distribution-free uncertainty quantification for a denoising task with real experimental data and the first to propose adaptive acquisition based on reconstruction uncertainty. © 2025 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

Improved Trade-Offs Between Amortization and Download Bandwidth for Linear HSS 5

Improved Trade-Offs Between Amortization and Download Bandwi...

引用

5th Conference on Information-Theoretic Cryptography, ITC 2024

作者： Blackwell, Keller Wootters, Mary Department of Computer Science Stanford University CA United States Departments of Computer Science and Electrical Engineering Stanford University CA United States

ISBN: (纸本)9783959773331

A Homomorphic Secret Sharing (HSS) scheme is a secret-sharing scheme that shares a secret x among s servers, and additionally allows an output client to reconstruct some function f(x) using information that can be locally computed by each server. A key parameter in HSS schemes is download rate, which quantifies how much information the output client needs to download from the servers. Often, download rate is improved by amortizing over instances of the problem, making also a key parameter of interest. Recent work [23] established a limit on the download rate of linear HSS schemes for computing low-degree polynomials and constructed schemes that achieve this optimal download rate;their schemes required amortization over = Ω(s log(s)) instances of the problem. Subsequent work [6] completely characterized linear HSS schemes that achieve optimal download rate in terms of a coding-theoretic notion termed optimal labelweight codes. A consequence of this characterization was that = Ω(s log(s)) is in fact necessary to achieve optimal download rate. In this paper, we characterize all linear HSS schemes, showing that schemes of any download rate are equivalent to a generalization of optimal labelweight codes. This equivalence is constructive and provides a way to obtain an explicit linear HSS scheme from any linear code. Using this characterization, we present explicit linear HSS schemes with slightly sub-optimal rate but with much improved amortization = O(s). Our constructions are based on algebraic geometry codes (specifically Hermitian codes and Goppa codes). © Keller Blackwell and Mary Wootters.

关键词： Forward error correction

来源：评论

学校读者我要写书评

暂无评论

An information-theoretic lower bound in time-uniform estimation 37

An information-theoretic lower bound in time-uniform estimat...

引用

37th Annual Conference on Learning Theory, COLT 2024

作者： Duchi, John Haque, Saminul Departments of Statistics and Electrical Engineering Stanford University United States Department of Computer Science Stanford University United States

We present an information-theoretic lower bound for the problem of parameter estimation with time-uniform coverage guarantees. Via a new a reduction to sequential testing, we obtain stronger lower bounds that capture the hardness of the time-uniform setting. In the case of location model estimation, logistic regression, and exponential family models, our Ω(√n-1 log log n) lower bound is sharp to within constant factors in typical settings. © 2024 J. Duchi & S. Haque.

关键词： Logistic regression

来源：评论

学校读者我要写书评

暂无评论

A Prototype Preceding Vehicle Identification System Development and Field Evaluation 10

A Prototype Preceding Vehicle Identification System Developm...

引用

10th International Conference on Vehicle Technology and Intelligent Transport Systems, VEHITS 2024

作者： Mu, Zeyu Tu, Guancheng Shi, Austin Yang, Kun Sun, Yixin Shen, Cong Park, B. Brian Department of Systems & Information Engineering University of Virginia CharlottesvilleVA United States Department of Computer Science University of Virginia CharlottesvilleVA United States Department of Electrical & Computer Engineering University of Virginia CharlottesvilleVA United States Departments of Computer Science and Electrical & Computer Engineering University of Virginia CharlottesvilleVA United States Departments of Civil & Environmental Engineering and Systems & Information Engineering University of Virginia CharlottesvilleVA United States

ISBN: (纸本)9789897587030

Preceding vehicle identification is crucial for establishing cooperative platooning. This paper presents the development of a prototype preceding vehicle identification system (PVIS) and its field evaluation for the assessment of commercial viability. We designed and assembled a prototype consisting of a processing unit (Jetson Nano board), a communication device (Wi-Fi dongle), a GPS unit, and a distance measurement sensor (Terabee sensor). The Jetson Nano integrates the SparkFun GPS-RTK-SMA unit, the Terabee time-of-flight sensor, and the Wi-Fi dongle. The PVIS prototype in the ego vehicle measures the distance to its preceding vehicle and receives the GPS data from potential preceding vehicles with the PVIS prototypes. With these, the PVIS in the ego vehicle determines the connectivity of the preceding vehicle. The field evaluation results showed that the prototype PVIS works as designed, and each successful identification takes about 5.3 seconds. However, it was found that the Terabee (time of flight) sensor, at times, did not properly measure distances, likely due to an angle issue caused by the roadway surface and vibration of the vehicle. We discussed how to overcome the challenges identified and enhance the prototype for successful commercialization. Copyright © 2024 by SCITEPRESS - science and Technology Publications, Lda.

关键词： Vehicle to vehicle communications

来源：评论

学校读者我要写书评

暂无评论

Patterned graphene oxide via one-step thermal annealing for controlling collective cell migration

引用

Journal of Materials Chemistry B 2024年第35期12卷 8733-8745页

作者： Huang, Chien-Yu Chen, Chong-You Wei, Chia-Hung Yang, Jia-Wei Lin, Yu-Chien Kao, Chih-Fei Chung, Johnson H. Y. Chen, Guan-Yu Institute of Biomedical Engineering College of Electrical and Computer Engineering National Yang Ming Chiao Tung University Hsinchu300093 Taiwan Department of Electrical and Computer Engineering College of Electrical and Computer Engineering National Yang Ming Chiao Tung University Hsinchu300093 Taiwan Department of Biological Science and Technology College of Biological Science and Technology National Yang Ming Chiao Tung University Hsinchu300093 Taiwan Intelligent Polymer Research Institute Institute for Innovative Materials University of Wollongong NSW2500 Australia National Yang Ming Chiao Tung University Hsinchu300093 Taiwan

Graphene oxide (GO) is a two-dimensional metastable nanomaterial. Interestingly, GO formed oxygen clusterings in addition to oxidized and graphitic phases during the low-temperature thermal annealing process, which could be further used for biomolecule bonding. By harnessing this property of GO, we created a bio-interface with patterned structures with a common laboratory hot plate that could tune cellular behavior by physical contact. Due to the regional distribution of oxygen clustering at the interface, we refer to it as patterned annealed graphene oxide (paGO). In addition, since the paGO was a heterogeneous interface and bonded biomolecules to varying degrees, arginine-glycine-aspartic acid (RGD) was modified on it and successfully regulated cellular-directed growth and migration. Finally, we investigated the FRET phenomenon of this heterogeneous interface and found that it has potential as a biosensor. The paGO interface has the advantages of easy regulation and fabrication, and the one-step thermal reduction method is suitable for biological applications. We believe that this low-temperature thermal annealing method would make GO interfaces more accessible, especially for the development of nano-interfacial modifications for biological applications, revealing its potential for biomedical applications. © 2024 The Royal Society of Chemistry.

关键词： Biomolecules

来源：评论

学校读者我要写书评

暂无评论

Achieving Capacity on Non-Binary Channels with Generalized Reed-Muller Codes

Achieving Capacity on Non-Binary Channels with Generalized R...

引用

2023 IEEE International Symposium on Information Theory, ISIT 2023

作者： Reeves, Galen Pfister, Henry D. Duke University Departments of Electrical and Computer Engineering United States Duke University Departments of Statistical Science United States Duke University Departments of Mathematics United States

ISBN: (纸本)9781665475549

Recently, the authors showed that Reed-Muller (RM) codes achieve capacity on binary memoryless symmetric (BMS) channels with respect to bit error rate. This paper extends that work by showing that RM codes defined on non-binary fields, known as generalized RM codes, achieve capacity on sufficiently symmetric non-binary channels with respect to symbol error rate. The new proof also simplifies the previous approach (for BMS channels) in a variety of ways that may be of independent interest. © 2023 IEEE.

关键词： Bit error rate

来源：评论

学校读者我要写书评

暂无评论

Leveraging uncertainty quantification in adaptive multiphoton microscopy acquisition

Leveraging uncertainty quantification in adaptive multiphoto...

引用

Computational Optical Imaging and Artificial Intelligence in Biomedical sciences 2024

作者： Ye, Cassandra Tong Han, Jiashu Liu, Kunzan Angelopoulos, Anastasios Griffith, Linda Monakhova, Kristina You, Sixian Department of Electrical Engineering and Computer Science Mit United States Fu Foundation School of Engineering and Applied Science Columbia University United States Department of Eecs University of California Berkeley United States Department of Biological Engineering Mit United States

ISBN: (纸本)9781510669734

Multiphoton microscopy (MPM) provides high-resolution imaging of deep tissue structures while allowing for the visualization of non-labeled biological samples. However, photon generation efficiency of intrinsic biomarkers is low and this, coupled with inherent detection inaccuracies in the photoelectric sensors, leads to an introduction of noise in acquired images. Higher dwelling times can reduce noise but increase the likelihood of photobleaching. To combat this, deep learning methods are being increasingly employed to denoise MPM images, allowing for a more efficient and less invasive process. However, machine learning models can hallucinate information, which is unacceptable for critical scientific microscopy applications. Uncertainty quantification, which has been demonstrated for image-to-image regression tasks, can provide confidence bounds for machine learning-based image reconstruction tasks, adding confidence to predictions. In this work, we discuss incorporating uncertainty quantification into an optimized denoising model to guide adaptive multiphoton microscopy image acquisition. We demonstrate that our method is capable of maintaining fine features in the denoised image, while outperforming other denoising methods by adaptively selecting to reimage the most uncertain pixels in a human endometrium tissue sample. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

Can Copyright Be Reduced to Privacy? 5

Can Copyright Be Reduced to Privacy?

引用

5th Symposium on Foundations of Responsible Computing, FORC 2024

作者： Elkin-Koren, Niva Hacohen, Uri Livni, Roi Moran, Shay Faculty of Law Tel Aviv University Israel School of Electrical Engineering Tel Aviv University Israel Departments of Mathematics and Computer Science Technion Haifa Israel

ISBN: (纸本)9783959773195

There is a growing concern that generative AI models will generate outputs closely resembling the copyrighted materials for which they are trained. This worry has intensified as the quality and complexity of generative models have immensely improved, and the availability of extensive datasets containing copyrighted material has expanded. Researchers are actively exploring strategies to mitigate the risk of generating infringing samples, with a recent line of work suggesting to employ techniques such as differential privacy and other forms of algorithmic stability to provide guarantees on the lack of infringing copying. In this work, we examine whether such algorithmic stability techniques are suitable to ensure the responsible use of generative models without inadvertently violating copyright laws. We argue that while these techniques aim to verify the presence of identifiable information in datasets, thus being privacy-oriented, copyright law aims to promote the use of original works for the benefit of society as a whole, provided that no unlicensed use of protected expression occurred. These fundamental differences between privacy and copyright must not be overlooked. In particular, we demonstrate that while algorithmic stability may be perceived as a practical tool to detect copying, such copying does not necessarily constitute copyright infringement. Therefore, if adopted as a standard for detecting an establishing copyright infringement, algorithmic stability may undermine the intended objectives of copyright law. © Niva Elkin-Koren, Uri Hacohen, Roi Livni, and Shay Moran.

关键词： Copyrights

来源：评论

学校读者我要写书评

暂无评论

Invertibility of Discrete-Time Linear Systems with Sparse Inputs 63

Invertibility of Discrete-Time Linear Systems with Sparse In...

引用

63rd IEEE Conference on Decision and Control, CDC 2024

作者： Poe, Kyle Mallada, Enrique Vidal, Rene University of Pennsylvania Applied Mathematics and Computational Science Group PA19104 United States Johns Hopkins University Mallada Is with the Department of Electrical and Computer Engineering MD21218 United States University of Pennsylvania Radiology Computer and Information Science Statistics and Data Science Departments of Electrical and Systems Engineering PA19104 United States

ISBN: (纸本)9798350316339

One of the fundamental problems of interest for discrete-time linear systems is whether its input sequence may be recovered given its output sequence, a.k.a. the left inversion problem. Many conditions on the state space geometry, dynamics, and spectral structure of a system have been used to characterize the well-posedness of this problem, without assumptions on the inputs. However, certain structural assumptions, such as input sparsity, have been shown to translate to practical gains in the performance of inversion algorithms, surpassing classical guarantees. Establishing necessary and sufficient conditions for left invertibility of systems with sparse inputs is therefore a crucial step toward understanding the performance limits of system inversion under structured input assumptions. In this work, we provide the first necessary and sufficient characterizations of left invertibility for linear systems with sparse inputs, echoing classic characterizations for standard linear systems. The key insight in deriving these results is in establishing the existence of two novel geometric invariants unique to the sparseinput setting, the weakly unobservable and strongly reachable subspace arrangements. By means of a concrete example, we demonstrate the utility of these characterizations. We conclude by discussing extensions and applications of this framework to several related problems in sparse control. © 2024 IEEE.

关键词： State space methods

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：