Search

Despite calls to modernize education preparation, the way we train, support, and grow educators has remained largely unchanged for decades. But some educator training and professional development organizations are taking a different approach by offering educators flexible and job-embedded learning opportunities that recognize and validate learning through demonstrations of competence. Educators earn "micro-credentials" in the form of digital badges, which capture both the skill the educator demonstrated and the evidence they used to prove their mastery of that skill. This case study offers a look at one micro-credential program, developed by UCLA's ExcEL Leadership Academy that has been approved for ESOL teacher certification in Rhode Island. The program offers a progression of 12 micro-credentials focused on the skills and competencies educators need to serve multilingual learners (MLLs) effectively. Additionally, the case study offers recommendations for other states that hope to offer their educators high-quality competency-based pathways to certification and/or professional growth.

Ionized bubble sizes during reionization trace physical properties of the first galaxies. JWST's ability to spectroscopically confirm and measure Lyman-alpha (Ly$\alpha$) emission in sub-L* galaxies opens the door to mapping ionized bubbles in 3D. However, existing Lya-based bubble measurement strategies rely on constraints from single galaxies, which are limited by the large variability in intrinsic Ly$\alpha$ emission. As a first step, we present two bubble size estimation methods using Lya spectroscopy of ensembles of galaxies, enabling us to map ionized structures and marginalize over Ly$\alpha$ emission variability. We test our methods using Gpc-scale reionization simulations of the intergalactic medium (IGM). To map bubbles in the plane of the sky, we develop an edge detection method based on the asymmetry of Ly$\alpha$ transmission as a function of spatial position. To map bubbles along the line-of-sight, we develop an algorithm using the tight relation between Ly$\alpha$ transmission and the line-of-sight distance from galaxies to the nearest neutral IGM patch. Both methods can robustly recover bubbles with radius $\gtrsim$10 comoving Mpc, sufficient for mapping bubbles even in the early phases of reionization, when the IGM is $\sim70-90\%$ neutral. These methods require $\gtrsim$0.002-0.004 galaxies/cMpc$^3$, a $5\sigma$ Ly$\alpha$ equivalent width upper limit of $\lesssim$30\r{A} for the faintest targets, and redshift precision $\Delta z \lesssim 0.015$, feasible with JWST spectroscopy. Shallower observations will provide robust lower limits on bubble sizes. Additional constraints on IGM transmission from Ly$\alpha$ escape fractions and line profiles will further refine these methods, paving the way to our first direct understanding of ionized bubble growth., Comment: 15 pages (+ 3 pages in Appendix), 17 figures, submitted to A&A

The SECP256K1 elliptic curve algorithm is fundamental in cryptocurrency wallets for generating secure public keys from private keys, thereby ensuring the protection and ownership of blockchain-based digital assets. However, the literature highlights several successful side-channel attacks on hardware wallets that exploit SECP256K1 to extract private keys. This work proposes a novel hardware architecture for SECP256K1, optimized for side-channel attack resistance and efficient resource utilization. The architecture incorporates complete addition formulas, temporary registers, and parallel processing techniques, making elliptic curve point addition and doubling operations indistinguishable. Implementation results demonstrate an average reduction of 45% in LUT usage compared to similar works, emphasizing the design's resource efficiency., Comment: Presented at HASP 2024 @ MICRO 2024 https://haspworkshop.org/2024/program.html

The goal of machine learning is generalization. While the No Free Lunch Theorem states that we cannot obtain theoretical guarantees for generalization without further assumptions, in practice we observe that simple models which explain the training data generalize best: a principle called Occam's razor. Despite the need for simple models, most current approaches in machine learning only minimize the training error, and at best indirectly promote simplicity through regularization or architecture design. Here, we draw a connection between Occam's razor and in-context learning: an emergent ability of certain sequence models like Transformers to learn at inference time from past observations in a sequence. In particular, we show that the next-token prediction loss used to train in-context learners is directly equivalent to a data compression technique called prequential coding, and that minimizing this loss amounts to jointly minimizing both the training error and the complexity of the model that was implicitly learned from context. Our theory and the empirical experiments we use to support it not only provide a normative account of in-context learning, but also elucidate the shortcomings of current in-context learning methods, suggesting ways in which they can be improved. We make our code available at https://github.com/3rdCore/PrequentialCode.

Large Language Models (LLMs) perform outstandingly in various downstream tasks, and the use of the Retrieval-Augmented Generation (RAG) architecture has been shown to improve performance for legal question answering (Nuruzzaman and Hussain, 2020; Louis et al., 2024). However, there are limited applications in insurance questions-answering, a specific type of legal document. This paper introduces two corpora: the Quebec Automobile Insurance Expertise Reference Corpus and a set of 82 Expert Answers to Layperson Automobile Insurance Questions. Our study leverages both corpora to automatically and manually assess a GPT4-o, a state-of-the-art LLM, to answer Quebec automobile insurance questions. Our results demonstrate that, on average, using our expertise reference corpus generates better responses on both automatic and manual evaluation metrics. However, they also highlight that LLM QA is unreliable enough for mass utilization in critical areas. Indeed, our results show that between 5% to 13% of answered questions include a false statement that could lead to customer misunderstanding., Comment: Accepted to NLLP 2024 EMNLP workshop

Exploration of unknown, unstructured environments, such as in search and rescue, cave exploration, and planetary missions,presents significant challenges due to their unpredictable nature. This unpredictability can lead to inefficient path planning and potential mission failures. We propose a multi-objective risk assessment method for exploration planning in such unconstrained environments. Our approach dynamically adjusts the weight of various risk factors to prevent the robot from undertaking lethal actions too early in the mission. By gradually increasing the allowable risk as the mission progresses, our method enables more efficient exploration. We evaluate risk based on environmental terrain properties, including elevation, slope, roughness, and traversability, and account for factors like battery life, mission duration, and travel distance. Our method is validated through experiments in various subterranean simulated cave environments. The results demonstrate that our approach ensures consistent exploration without incurring lethal actions, while introducing minimal computational overhead to the planning process., Comment: 7 pages, 8 figures, submitted to ICRA 2025

We present FastLexRank\footnote{https://github.com/LiMaoUM/FastLexRank}, an efficient and scalable implementation of the LexRank algorithm for text ranking. Designed to address the computational and memory complexities of the original LexRank method, FastLexRank significantly reduces time and memory requirements from $\mathcal{O}(n^2)$ to $\mathcal{O}(n)$ without compromising the quality or accuracy of the results. By employing an optimized approach to calculating the stationary distribution of sentence graphs, FastLexRank maintains an identical results with the original LexRank scores while enhancing computational efficiency. This paper details the algorithmic improvements that enable the processing of large datasets, such as social media corpora, in real-time. Empirical results demonstrate its effectiveness, and we propose its use in identifying central tweets, which can be further analyzed using advanced NLP techniques. FastLexRank offers a scalable solution for text centrality calculation, addressing the growing need for efficient processing of digital content.

Heavy-tailed models are often used as a way to gain robustness against outliers in Bayesian analyses. On the other side, in frequentist analyses, M-estimators are often employed. In this paper, the two approaches are reconciled by considering M-estimators as maximum likelihood estimators of heavy-tailed models. We realize that, even from this perspective, there is a fundamental difference in that frequentists do not require these heavy-tailed models to be proper. It is shown what the difference between improper and proper heavy-tailed models can be in terms of estimation results through two real-data analyses based on linear regression. The findings of this paper make us ponder on the use of improper heavy-tailed data models in Bayesian analyses, an approach which is seen to fit within the generalized Bayesian framework of Bissiri et al. (2016) when combined with proper prior distributions yielding proper (generalized) posterior distributions.

Paired cluster-randomized experiments (pCRTs) are common across many disciplines because there is often natural clustering of individuals, and paired randomization can help balance baseline covariates to improve experimental precision. Although pCRTs are common, there is surprisingly no obvious way to analyze this randomization design if an individual-level (rather than cluster-level) treatment effect is of interest. Variance estimation is also complicated due to the dependency created through pairing clusters. Therefore, we aim to provide an intuitive and practical comparison between different estimation strategies in pCRTs in order to inform practitioners' choice of strategy. To this end, we present a general framework for design-based estimation in pCRTs for average individual effects. This framework offers a novel and intuitive view on the bias-variance trade-off between estimators and emphasizes the benefits of covariate adjustment for estimation with pCRTs. In addition to providing a general framework for estimation in pCRTs, the point and variance estimators we present support fixed-sample unbiased estimation with similar precision to a common regression model and consistently conservative variance estimation. Through simulation studies, we compare the performance of the point and variance estimators reviewed. Finally, we compare the performance of estimators with simulations using real data from an educational efficacy trial. Our analysis and simulation studies inform the choice of point and variance estimators for analyzing pCRTs in practice.

Insects represent half of all global biodiversity, yet many of the world's insects are disappearing, with severe implications for ecosystems and agriculture. Despite this crisis, data on insect diversity and abundance remain woefully inadequate, due to the scarcity of human experts and the lack of scalable tools for monitoring. Ecologists have started to adopt camera traps to record and study insects, and have proposed computer vision algorithms as an answer for scalable data processing. However, insect monitoring in the wild poses unique challenges that have not yet been addressed within computer vision, including the combination of long-tailed data, extremely similar classes, and significant distribution shifts. We provide the first large-scale machine learning benchmarks for fine-grained insect recognition, designed to match real-world tasks faced by ecologists. Our contributions include a curated dataset of images from citizen science platforms and museums, and an expert-annotated dataset drawn from automated camera traps across multiple continents, designed to test out-of-distribution generalization under field conditions. We train and evaluate a variety of baseline algorithms and introduce a combination of data augmentation techniques that enhance generalization across geographies and hardware setups., Comment: Published at ECCV 2024. The dataset is publicly available at https://github.com/RolnickLab/ami-dataset

The Mathematics, 3D Printing, and Computational Thinking Through Work-Based Learning (MPACT) program combines teacher professional development, specialized curriculum and materials and STEM industry mentors to provide grade 4-7 students with project-based experiences implemented across three learning modules. This technical report presents findings from SRI International's evaluation of MPACT implementationin the 2021-22 school year by MPACT Fellows--i.e., teachers who participated in the MPACT program--in four U.S. states. MPACT Fellows implemented the program in a year marked by ongoing difficulties due to the COVID-19 pandemic. Although MPACT professional development was delivered with fidelity, only 65% of MPACT Fellows implemented the full program (all three modules) with all of their classes. MPACT Fellows also provided fewer opportunities for students to meet with or learn about STEM industry mentors than intended. Despite this partial implementation, MPACT Fellows' perceptions of and efficacy in programmatic concepts increased meaningfully after participating in MPACT. Further, grade 4 and 5 MPACT students grew nearly a full standard deviation on a measure of geometry, computational thinking, and spatial reasoning over one school year. However, significant differences were not observed in students' socioemotional outcomes--specifically, behavioral engagement in math, behavioral disaffection in math, math self-efficacy, and math self-concept--between MPACT students and students in the comparison group. The considerable growth of MPACT students on the assessment and the documented program impacts on teachers' perceptions provide limited but suggestive evidence that the program could demonstrate improved student outcomes in ideal conditions, if examined over a longer time frame or using different impact measures.

Hydro-Quebec (HQ) is a vertically integrated utility that produces, transmits, and distributes most of the electricity in the province of Quebec. The power grid it operates has a particular architecture created by large hydroelectric dams located far north and the extensive 735kV transmission grid that allows the generated power to reach the majority of the load located thousands of kilometers away in the southern region of Quebec. The specificity of the grid has led HQ to develop monitoring tools responsible for generating so-called stability limits. Those stability limits take into account several nonlinear phenomena such as angular stability, frequency stability, or voltage stability. Since generation planning and operation tools rely mostly on mixed integer linear programming formulation, HQ had to adapt its tools to integrate stability limits into them. This paper presents the challenges it faced, especially considering its reserve monitoring tool and unit commitment tool., Comment: 12 pages, 7 figures, 7 tables, 1 algorithm

Large autoregressive models like Transformers can solve tasks through in-context learning (ICL) without learning new weights, suggesting avenues for efficiently solving new tasks. For many tasks, e.g., linear regression, the data factorizes: examples are independent given a task latent that generates the data, e.g., linear coefficients. While an optimal predictor leverages this factorization by inferring task latents, it is unclear if Transformers implicitly do so or if they instead exploit heuristics and statistical shortcuts enabled by attention layers. Both scenarios have inspired active ongoing work. In this paper, we systematically investigate the effect of explicitly inferring task latents. We minimally modify the Transformer architecture with a bottleneck designed to prevent shortcuts in favor of more structured solutions, and then compare performance against standard Transformers across various ICL tasks. Contrary to intuition and some recent works, we find little discernible difference between the two; biasing towards task-relevant latent variables does not lead to better out-of-distribution performance, in general. Curiously, we find that while the bottleneck effectively learns to extract latent task variables from context, downstream processing struggles to utilize them for robust prediction. Our study highlights the intrinsic limitations of Transformers in achieving structured ICL solutions that generalize, and shows that while inferring the right latents aids interpretability, it is not sufficient to alleviate this problem.

Historically, open source commitments have been deemed irrevocable once materials are released under open source licenses. In this paper, the authors argue for the creation of a subset of rights that allows open source contributors to force users to (i) update to the most recent version of a model, (ii) accept new use case restrictions, or even (iii) cease using the software entirely. While this would be a departure from the traditional open source approach, the legal, reputational and moral risks related to open-sourcing AI models could justify contributors having more control over downstream uses. Recent legislative changes have also opened the door to liability of open source contributors in certain cases. The authors believe that contributors would welcome the ability to ensure that downstream users are implementing updates that address issues like bias, guardrail workarounds or adversarial attacks on their contributions. Finally, this paper addresses how this license category would interplay with RAIL licenses, and how it should be operationalized and adopted by key stakeholders such as OSS platforms and scanning tools.

The 2024 Brain Tumor Segmentation Meningioma Radiotherapy (BraTS-MEN-RT) challenge aims to advance automated segmentation algorithms using the largest known multi-institutional dataset of radiotherapy planning brain MRIs with expert-annotated target labels for patients with intact or postoperative meningioma that underwent either conventional external beam radiotherapy or stereotactic radiosurgery. Each case includes a defaced 3D post-contrast T1-weighted radiotherapy planning MRI in its native acquisition space, accompanied by a single-label "target volume" representing the gross tumor volume (GTV) and any at-risk postoperative site. Target volume annotations adhere to established radiotherapy planning protocols, ensuring consistency across cases and institutions. For preoperative meningiomas, the target volume encompasses the entire GTV and associated nodular dural tail, while for postoperative cases, it includes at-risk resection cavity margins as determined by the treating institution. Case annotations were reviewed and approved by expert neuroradiologists and radiation oncologists. Participating teams will develop, containerize, and evaluate automated segmentation models using this comprehensive dataset. Model performance will be assessed using an adapted lesion-wise Dice Similarity Coefficient and the 95% Hausdorff distance. The top-performing teams will be recognized at the Medical Image Computing and Computer Assisted Intervention Conference in October 2024. BraTS-MEN-RT is expected to significantly advance automated radiotherapy planning by enabling precise tumor segmentation and facilitating tailored treatment, ultimately improving patient outcomes., Comment: 14 pages, 9 figures, 1 table

Gliomas are the most common malignant primary brain tumors in adults and one of the deadliest types of cancer. There are many challenges in treatment and monitoring due to the genetic diversity and high intrinsic heterogeneity in appearance, shape, histology, and treatment response. Treatments include surgery, radiation, and systemic therapies, with magnetic resonance imaging (MRI) playing a key role in treatment planning and post-treatment longitudinal assessment. The 2024 Brain Tumor Segmentation (BraTS) challenge on post-treatment glioma MRI will provide a community standard and benchmark for state-of-the-art automated segmentation models based on the largest expert-annotated post-treatment glioma MRI dataset. Challenge competitors will develop automated segmentation models to predict four distinct tumor sub-regions consisting of enhancing tissue (ET), surrounding non-enhancing T2/fluid-attenuated inversion recovery (FLAIR) hyperintensity (SNFH), non-enhancing tumor core (NETC), and resection cavity (RC). Models will be evaluated on separate validation and test datasets using standardized performance metrics utilized across the BraTS 2024 cluster of challenges, including lesion-wise Dice Similarity Coefficient and Hausdorff Distance. Models developed during this challenge will advance the field of automated MRI segmentation and contribute to their integration into clinical practice, ultimately enhancing patient care., Comment: 10 pages, 4 figures, 1 table

Lifted samplers form a class of Markov chain Monte Carlo methods which has drawn a lot attention in recent years due to superior performance in challenging Bayesian applications. A canonical example of such sampler is the one that is derived from a random walk Metropolis algorithm for a totally-ordered state space such as the integers or the real numbers. The lifted sampler is derived by splitting into two the proposal distribution: one part in the increasing direction, and the other part in the decreasing direction. It keeps following a direction, until a rejection, upon which it flips the direction. In terms of asymptotic variances, it outperforms the random walk Metropolis algorithm, regardless of the target distribution, at no additional computational cost. Other studies show, however, that beyond this simple case, lifted samplers do not always outperform their Metropolis counterparts. In this paper, we leverage the celebrated work of Tierney (1998) to provide an analysis in a general framework encompassing a broad class of lifted samplers. Our finding is that, essentially, the asymptotic variances cannot increase by a factor of more than 2, regardless of the target distribution, the way the directions are induced, and the type of algorithm from which the lifted sampler is derived (be it a Metropolis--Hastings algorithm, a reversible jump algorithm, etc.). This result indicates that, while there is potentially a lot to gain from lifting a sampler, there is not much to lose.

We know the importance of learning experiences that happen beyond the confines of a traditional classroom. But how might federal policy support such experiences to prepare young people for life after high school? That's where work-based learning comes in -- a strategy designed to help students connect what they learn in the classroom with what is expected in the workplace by integrating learning with real-world applications in partnership with industry professionals. While momentum is growing at the local and state levels to design and implement PK-12 through workforce pathways to support work-based learning, there is still much work to be done in creating truly supportive policy environments. This set of federal policy recommendations outlines how enabling policies could further incentivize and focus increased resources on pathways and work-based learning.

The new world of work demands not only academic knowledge and skills but also transferable skills such as communications, creativity, and collaboration--skills that are rarely captured formally. Meeting that demand will require a new approach to the high school diploma. The opportunity is ripe to redesign credentials to enable competency-based pathways and learning. The transcript for the next generation ("next gen") of learning and work will better represent what individuals have actually learned, what they know, and what they can do. It's time to explore how all learners (adults and youth) could record and communicate their learning from a variety of powerful learning experiences using the next generation of credentials. The goal of this report is to deepen state policy makers' understanding of the changes needed to facilitate meaningful next gen credentials and advance state policy to support those changes. This includes building support to modernize education, opening pathways for learning and reskilling, and providing value for lifelong learning to both individuals and employers. Students, families, employers, and organizations focused on education and employment, as well as nations around the globe, are exploring how to ensure students receive a world-class education that builds knowledge and skills needed for the future. New models of credentialing knowledge, skills, and qualifications are emerging to help achieve this goal. [Funding was provided by the Stand Together Trust.]

With the increasing demand for audiovisual services, telecom service providers and application developers are compelled to ensure that their services provide the best possible user experience. Particularly, services such as videoconferencing are very sensitive to network conditions. Therefore, their performance should be monitored in real time in order to adjust parameters to any network perturbation. In this paper, we developed a parametric model for estimating the perceived audiovisual quality in videoconference services. Our model is developed with the nonlinear autoregressive exogenous (NARX) recurrent neural network and estimates the perceived quality in terms of mean opinion score (MOS). We validate our model using the publicly available INRS bitstream audiovisual quality dataset. This dataset contains bitstream parameters such as loss per frame, bit rate and video duration. We compare the proposed model against state-of-the-art methods based on machine learning and show our model to outperform these methods in terms of mean square error (MSE=0.150) and Pearson correlation coefficient (R=0.931)

Accurately interpreting induced polarization (IP) data that reflects the inherent anisotropy of the Earth's crust requires anisotropic IP models. The Generalized Effective Medium Theory of Induced Polarization (GEMTIP) model effectively simulates the IP signatures of rocks containing polarizable minerals. A pivotal element of the GEMTIP model is calculating the depolarization tensor elements, an intensive task for anisotropic rocks because one must numerically solve six parametric integrals for each mineral inclusion. This study aims to streamline anisotropic IP simulations by extending the GEMTIP framework and introducing a machine learning approach to estimate the depolarization tensors. The theoretical contributions of this research are two-fold: (1) we augment the GEMTIP model to encompass anisotropic background conductivity and triaxial ellipsoidal inclusions, and (2) we reformulate the depolarization integrals to normalize their input and output variables, facilitating their estimation by neural networks. Validation against analytical solutions for spherical and spheroidal inclusions corroborates the accuracy of the neural network. Analyzing the neural network model, we find that the relationship between chargeability and polarizable inclusion content is increasingly uncertain for increasingly anisotropic rocks. A similar observation applies to the relationship between critical frequency and host rock conductivity. Moreover, the depolarization tensors are, on average, 56 % sensitive to inclusion anisotropy and 44 % sensitive to host rock conductivity anisotropy. Remarkably, our neural network drastically accelerates GEMTIP simulations--up to 100,000 times faster than numerical integration--without substantially sacrificing accuracy. This advancement is promising for efficient rock-scale IP modeling in complex and anisotropic geological settings., Comment: 25 pages, 4 tables, 11 figures, 1 appendix. Original manuscript version submitted to Geophysics

Deep Neural Networks (DNNs) have revolutionized a wide range of industries, from healthcare and finance to automotive, by offering unparalleled capabilities in data analysis and decision-making. Despite their transforming impact, DNNs face two critical challenges: the vulnerability to adversarial attacks and the increasing computational costs associated with more complex and larger models. In this paper, we introduce an effective method designed to simultaneously enhance adversarial robustness and execution efficiency. Unlike prior studies that enhance robustness via uniformly injecting noise, we introduce a non-uniform noise injection algorithm, strategically applied at each DNN layer to disrupt adversarial perturbations introduced in attacks. By employing approximation techniques, our approach identifies and protects essential neurons while strategically introducing noise into non-essential neurons. Our experimental results demonstrate that our method successfully enhances both robustness and efficiency across several attack scenarios, model architectures, and datasets.

Spatial variations in survey properties due to selection effects generate substantial systematic errors in large-scale structure measurements in optical galaxy surveys on very large scales. On such scales, the statistical sensitivity of optical surveys is also limited by their finite sky coverage. By contrast, gravitational wave (GW) sources appear to be relatively free of these issues, provided the angular sensitivity of GW experiments can be accurately characterized. We quantify the expected cosmological information gain from combining the forecast LSST 3$\times$2pt analysis (combination of three 2-point correlations of galaxy density and weak lensing shear fields) with the large-scale auto-correlation of GW sources from proposed next-generation GW experiments. We find that in $\Lambda$CDM and $w$CDM models, there is no significant improvement in cosmological constraints from combining GW with LSST 3$\times$2pt over LSST alone, due to the large shot noise for the former; however, this combination does enable a $\sim6\%$ constraint on the linear galaxy bias of GW sources. More interestingly, the optical-GW data combination provides tight constraints on models with primordial non-Gaussianity (PNG), due to the predicted scale-dependent bias in PNG models on large scales. Assuming that the largest angular scales that LSST will probe are comparable to those in Stage III surveys ($\ell_{\rm min}\sim50$), the inclusion of next-generation GW measurements could improve constraints on the PNG parameter $f_{\rm NL}$ by up to a factor of $\simeq6.6$ compared to LSST alone, yielding $\sigma(f_{\rm NL})=8.5$. These results assume the expected capability of a network of Einstein Telescope-like GW observatories, with a detection rate of $10^6$ events/year. We investigate the sensitivity of our results to different assumptions about future GW detectors as well as different LSST analysis choices., Comment: 16 pages, 8 figures, 5 tables

We present highly sampled photometry of the supernova (SN) 2023ixf, a Type II SN in M101, beginning 2 days before its first known detection. To gather these data, we enlisted the global Unistellar Network of citizen scientists. These 252 observations from 115 telescopes show the SN's rising brightness associated with shock emergence followed by gradual decay. We measure a peak $M_{V}$ = -18.18 $\pm$ 0.09 mag at 2023-05-25 21:37 UTC in agreement with previously published analyses., Comment: 4 pages, 1 figure