SearcharxivSearch

arXiv subjects

Alexander Szalay

Publications and source records attributed to Alexander Szalay.

16 recordsLinked to original sources

Self-ensemble: Mitigating Confidence Mis-calibration for Large Language Models

Although Large Language Models (LLMs) perform well in general fields, they exhibit a confidence distortion problem on multi-choice question-answering (MCQA), particularly as the number of answer choices increases. Specifically, on MCQA with many choices, LLMs suffer from under-confidence in correct predictions and over-confidence in incorrect ones, leading to a substantially degraded performance. To solve this problem, we propose Self-ensemble in this work. Our method splits the choices into several groups and ensembles LLM predictions across these groups to reach a final decision. The advantage of Self-ensemble is its plug-and-play nature, where it can be integrated into existing LLM architecture based on a designed attention mask and positional encoding, without requiring labeled datasets for parameter tuning. Experimental results on three LLMs and datasets demonstrate that Self-ensemble comprehensively addresses the confidence distortion problem of LLMs, outperforming standard inference as well as baseline methods.

cs.CL

Vortices within vortices: hierarchical nature of vortex tubes in turbulence

The JHU turbulence database [1] can be used with a state of the art visualisation tool [2] to generate high quality fluid dynamics videos. In this work we investigate the classical idea that smaller structures in turbulent flows, while engaged in their own internal dynamics, are advected by the larger structures. They are not advected undistorted, however. We see instead that the small scale structures are sheared and twisted by the larger scales. This illuminates the basic mechanisms of the turbulent cascade.

physics.flu-dyn

Sketch and Scale: Geo-distributed tSNE and UMAP

Running machine learning analytics over geographically distributed datasets is a rapidly arising problem in the world of data management policies ensuring privacy and data security. Visualizing high dimensional data using tools such as t-distributed Stochastic Neighbor Embedding (tSNE) and Uniform Manifold Approximation and Projection (UMAP) became common practice for data scientists. Both tools scale poorly in time and memory. While recent optimizations showed successful handling of 10,000 data points, scaling beyond million points is still challenging. We introduce a novel framework: Sketch and Scale (SnS). It leverages a Count Sketch data structure to compress the data on the edge nodes, aggregates the reduced size sketches on the master node, and runs vanilla tSNE or UMAP on the summary, representing the densest areas, extracted from the aggregated sketch. We show this technique to be fully parallel, scale linearly in time, logarithmically in memory, and communication, making it possible to analyze datasets with many millions, potentially billions of data points, spread across several data centers around the globe. We demonstrate the power of our method on two mid-size datasets: cancer data with 52 million 35-band pixels from multiple images of tumor biopsies; and astrophysics data of 100 million stars with multi-color photometry from the Sloan Digital Sky Survey (SDSS).

cs.DC

Six Dimensional Streaming Algorithm for Cluster Finding in N-Body Simulations

Cosmological N-body simulations are crucial for understanding how the Universe evolves. Studying large-scale distributions of matter in these simulations and comparing them to observations usually involves detecting dense clusters of particles called "halos,'' which are gravitationally bound and expected to form galaxies. However, traditional cluster finders are computationally expensive and use massive amounts of memory. Recent work by Liu et al (Liu et al. (2015)) showed the connection between cluster detection and memory-efficient streaming algorithms and presented a halo finder based on heavy hitter algorithm. Later, Ivkin et al. (Ivkin et al. (2018)) improved the scalability of suggested streaming halo finder with efficient GPU implementation. Both works map particles' positions onto a discrete grid, and therefore lose the rest of the information, such as their velocities. Therefore, two halos travelling through each other are indistinguishable in positional space, while the velocity distribution of those halos can help to identify this process which is worth further studying. In this project we analyze data from the Millennium Simulation Project (Springel et al. (2005)) to motivate the inclusion of the velocity into streaming method we introduce. We then demonstrate a use of suggested method, which allows one to find the same halos as before, while also detecting those which were indistinguishable in prior methods.

astro-ph.GA

The Wide Field Infrared Survey Telescope: 100 Hubbles for the 2020s

The Wide Field Infrared Survey Telescope (WFIRST) is a 2.4m space telescope with a 0.281 deg^2 field of view for near-IR imaging and slitless spectroscopy and a coronagraph designed for > 10^8 starlight suppresion. As background information for Astro2020 white papers, this article summarizes the current design and anticipated performance of WFIRST. While WFIRST does not have the UV imaging/spectroscopic capabilities of the Hubble Space Telescope, for wide field near-IR surveys WFIRST is hundreds of times more efficient. Some of the most ambitious multi-cycle HST Treasury programs could be executed as routine General Observer (GO) programs on WFIRST. The large area and time-domain surveys planned for the cosmology and exoplanet microlensing programs will produce extraordinarily rich data sets that enable an enormous range of Archival Research (AR) investigations. Requirements for the coronagraph are defined based on its status as a technology demonstration, but its expected performance will enable unprecedented observations of nearby giant exoplanets and circumstellar disks. WFIRST is currently in the Preliminary Design and Technology Completion phase (Phase B), on schedule for launch in 2025, with several of its critical components already in production.

astro-ph.IM

Hadoop in Low-Power Processors

In our previous work we introduced a so-called Amdahl blade microserver that combines a low-power Atom processor, with a GPU and an SSD to provide a balanced and energy-efficient system. Our preliminary results suggested that the sequential I/O of Amdahl blades can be ten times higher than that a cluster of conventional servers with comparable power consumption. In this paper we investigate the performance and energy efficiency of Amdahl blades running Hadoop. Our results show that Amdahl blades are 7.7 times and 3.4 times as energy-efficient as the Open Cloud Consortium cluster for a data-intensive and a compute-intensive application, respectively. The Hadoop Distributed Filesystem has relatively poor performance on Amdahl blades because both disk and network I/O are CPU-heavy operations on Atom processors. We demonstrate three effective techniques to reduce CPU consumption and improve performance. However, even with these improvements, the Atom processor is still the system's bottleneck. We revisit Amdahl's law, and estimate that Amdahl blades need four Atom cores to be well balanced for Hadoop tasks.

cs.DC

Spatial Indexing of Large Multidimensional Databases

Scientific endeavors such as large astronomical surveys generate databases on the terabyte scale. These, usually multidimensional databases must be visualized and mined in order to find interesting objects or to extract meaningful and qualitatively new relationships. Many statistical algorithms required for these tasks run reasonably fast when operating on small sets of in-memory data, but take noticeable performance hits when operating on large databases that do not fit into memory. We utilize new software technologies to develop and evaluate fast multidimensional indexing schemes that inherently follow the underlying, highly non-uniform distribution of the data: they are layered uniform grid indices, hierarchical binary space partitioning, and sampled flat Voronoi tessellation of the data. Our working database is the 5-dimensional magnitude space of the Sloan Digital Sky Survey with more than 270 million data points, where we show that these techniques can dramatically speed up data mining operations such as finding similar objects by example, classifying objects or comparing extensive simulation sets with observations. We are also developing tools to interact with the multidimensional database and visualize the data at multiple resolutions in an adaptive manner.

cs.DB

The organization and management of the Virtual Astronomical Observatory

The U.S. Virtual Astronomical Observatory (VAO; http://www.us-vao.org/) has been in operation since May 2010. Its goal is to enable new science through efficient integration of distributed multi-wavelength data. This paper describes the management and organization of the VAO, and emphasizes the techniques used to ensure efficiency in a distributed organization. Management methods include using an annual program plan as the basis for establishing contracts with member organizations, regular communication, and monitoring of processes.

astro-ph.IM

Array Requirements for Scientific Applications and an Implementation for Microsoft SQL Server

This paper outlines certain scenarios from the fields of astrophysics and fluid dynamics simulations which require high performance data warehouses that support array data type. A common feature of all these use cases is that subsetting and preprocessing the data on the server side (as far as possible inside the database server process) is necessary to avoid the client-server overhead and to minimize IO utilization. Analyzing and summarizing the requirements of the various fields help software engineers to come up with a comprehensive design of an array extension to relational database systems that covers a wide range of scientific applications. We also present a working implementation of an array data type for Microsoft SQL Server 2008 to support large-scale scientific applications. We introduce the design of the array type, results from a performance evaluation, and discuss the lessons learned from this implementation. The library can be downloaded from our website at http://voservices.net/sqlarray/

cs.DB

IVOA Recommendation: IVOA Astronomical Data Query Language Version 2.00

This document describes the Astronomical Data Query Language (ADQL). ADQL has been developed based on SQL92. This document describes the subset of the SQL grammar supported by ADQL. Special restrictions and extensions to SQL92 have been defined in order to support generic and astronomy specific operations.

astro-ph.IM

Geometry of the Cosmic Web: Minkowski Functionals from the Delaunay Tessellation

We present a novel method for computing the Minkowski Functionals from isodensity surfaces extracted directly from the Delaunay tessellation of a point distribution. This is an important step forward compared to the previous cosmological studies when the isodensity surface was built in the field on a uniform cubic grid and therefore having a uniform spatial resolution. The density field representing a particular interest in cosmology is the density of galaxies which is obtained from the highly nonuniform distribution of the galaxy positions. Therefore, the constraints caused by the spatially uniform grid put severe limitations on the studies of the geometry and shapes of the large-scale objects: superclusters and voids of galaxies. Our technique potentially is able to eliminate most of these limitations. The method is tested with some simple geometric models and an application to the density field from an N-body simulation is shown.

astro-ph.CO

A public turbulence database cluster and applications to study Lagrangian evolution of velocity increments in turbulence

A public database system archiving a direct numerical simulation (DNS) data set of isotropic, forced turbulence is described in this paper. The data set consists of the DNS output on $1024^3$ spatial points and 1024 time-samples spanning about one large-scale turn-over timescale. This complete $1024^4$ space-time history of turbulence is accessible to users remotely through an interface that is based on the Web-services model. Users may write and execute analysis programs on their host computers, while the programs make subroutine-like calls that request desired parts of the data over the network. The users are thus able to perform numerical experiments by accessing the 27 Terabytes of DNS data using regular platforms such as laptops. The architecture of the database is explained, as are some of the locally defined functions, such as differentiation and interpolation. Test calculations are performed to illustrate the usage of the system and to verify the accuracy of the methods. The database is then used to analyze a dynamical model for small-scale intermittency in turbulence. Specifically, the dynamical effects of pressure and viscous terms on the Lagrangian evolution of velocity increments are evaluated using conditional averages calculated from the DNS data in the database. It is shown that these effects differ considerably among themselves and thus require different modeling strategies in Lagrangian models of velocity increments and intermittency.

physics.flu-dyn

Photometric Redshift Estimation on SDSS Data Using Random Forests

Given multiband photometric data from the SDSS DR6, we estimate galaxy redshifts. We employ a Random Forest trained on color features and spectroscopic redshifts from 80,000 randomly chosen primary galaxies yielding a mapping from color to redshift such that the difference between the estimate and the spectroscopic redshift is small. Our methodology results in tight RMS scatter in the estimates limited by photometric errors. Additionally, this approach yields an error distribution that is nearly Gaussian with parameter estimates giving reliable confidence intervals unique to each galaxy photometric redshift.

astro-ph

The SDSS SkyServer, Public Access to the Sloan Digital Sky Server Data

The SkyServer provides Internet access to the public Sloan Digital Sky Survey (SDSS) data for both astronomers and for science education. This paper describes the SkyServer goals and architecture. It also describes our experience operating the SkyServer on the Internet. The SDSS data is public and well-documented so it makes a good test platform for research on database algorithms and performance.

cs.DL

Measuring the galaxy power spectrum with future redshift surveys

Precision measurements of the galaxy power spectrum P(k) require a data analysis pipeline that is both fast enough to be computationally feasible and accurate enough to take full advantage of high-quality data. We present a rigorous discussion of different methods of power spectrum estimation, with emphasis on the traditional Fourier method, the linear (Karhunen-Loeve; KL), and quadratic data compression schemes, showing in what approximations they give the same result. To improve speed, we show how many of the advantages of KL data compression and power spectrum estimation may be achieved with a computationally faster quadratic method. To improve accuracy, we derive analytic expressions for handling the integral constraint, since it is crucial that finite volume effects are accurately corrected for on scales comparable to the depth of the survey. We also show that for the KL and quadratic techniques, multiple constraints can be included via simple matrix operations, thereby rendering the results less sensitive to galactic extinction and mis-estimates of the radial selection function. We present a data analysis pipeline that we argue does justice to the increases in both quality and quantity of data that upcoming redshift surveys will provide. It uses three analysis techniques in conjunction: a traditional Fourier approach on small scales, a pixelized quadratic matrix method on large scales and a pixelized KL eigenmode analysis to probe anisotropic effects such as redshift-space distortions.

astro-ph

Higher Order Statistics from the Apm Galaxy Survey

We apply a new statistics, the factorial moment correlators, to density maps obtained from the APM survey. The resulting correlators are all proportional to the two point correlation function, substantially amplified, with an amplification nearly exponential with the total rank of the correlators. This confirms the validity of the hierarchical clustering assumption on the dynamic range examined, corresponding to $0.5 \hmpc - 50 \hmpc$ in three dimensional space. The Kirkwood superposition with loop terms is strongly rejected. The structure coefficients of the hierarchy are also fitted. The high quality of the APM catalog enabled us to disentangle the various contributions from the power spectrum, small scale nonlinear clustering, and combinatorial effects, all of which affect the amplification of the correlators. These effects should appear in correlations of clusters in a similar fashion.

astro-ph