Related papers: Performance of Random Template Banks
Grid search and random search are widely used techniques for hyperparameter tuning in machine learning, especially when gradient information is unavailable. In these methods, a finite set of candidate configurations is evaluated, and the…
All-sky surveys for isolated continuous gravitational waves present a significant data-analysis challenge. Semicoherent search methods are commonly used to efficiently perform the computationally-intensive task of searching for these weak…
Spatial range joins have many applications, including geographic information systems, location-based social networking services, neuroscience, and visualization. However, joins incur not only expensive computational costs but also too large…
Sparse neural networks have shown similar or better generalization performance than their dense counterparts while having higher parameter efficiency. This has motivated a number of works to learn or search for high performing sparse…
Random masks define surprisingly effective sparse neural network models, as has been shown empirically. The resulting sparse networks can often compete with dense architectures and state-of-the-art lottery ticket pruning algorithms, even…
Lattices in three dimensions are oft studied from the ``reciprocal space'' perspective of diffraction. Today, the full lattice of a crystal can often be inferred from direct-space information about three sets of non-parallel lattice planes.…
The spectra of random feature matrices provide essential information on the conditioning of the linear system used in random feature regression problems and are thus connected to the consistency and generalization of random feature models.…
Recent gravitational-wave observations have begun to constrain the internal physics of neutron stars. However, current detection searches for neutron star systems assume that potential neutron stars are low-mass black holes, ignoring any…
Random geometric graphs are a popular choice for a latent points generative model for networks. Their definition is based on a sample of $n$ points $X_1,X_2,\cdots,X_n$ on the Euclidean sphere~$\mathbb{S}^{d-1}$ which represents the latent…
Understanding geometric properties of natural language processing models' latent spaces allows the manipulation of these properties for improved performance on downstream tasks. One such property is the amount of data spread in a model's…
Within the calibration of material models, often the numerical results of a simulation model $y$ are compared with the experimental measurements $y^*$. Usually, the differences between measurements and simulation are minimized using least…
Graphical models are powerful tools for modeling high-dimensional data, but learning graphical models in the presence of latent variables is well-known to be difficult. In this work we give new results for learning Restricted Boltzmann…
With the improvement in sensitivity of gravitational wave (GW) detectors and the increasing diversity of GW sources, there is a strong need for accurate GW waveform models for data analysis. While the current model accuracy assessments…
In this paper three different scenarios in wide band spectrum sensing have been studied. While the signal and noise statistics are supposed to be unspecified, random matrixes have been utilized in order to estimate the noise variance. These…
Matrices with low-rank structure are ubiquitous in scientific computing. Choosing an appropriate rank is a key step in many computational algorithms that exploit low-rank structure. However, estimating the rank has been done largely in an…
Nested sampling parameter estimation differs from evidence estimation, in that it incurs an additional source of uncertainty. This uncertainty affects estimates of parameter means and credible intervals in gravitational wave analyses and…
We present a unified description of gravitational-wave data analysis that unites the template-based analysis used to detect deterministic signals from well-modeled sources, such as binary-black-hole mergers, with the cross-correlation…
A common technique for detection of gravitational-wave signals is searching for excess power in frequency-time maps of gravitational-wave detector data. In the event of a detection, model selection and parameter estimation will be performed…
Data is said to follow the transform (or analysis) sparsity model if it becomes sparse when acted on by a linear operator called a sparsifying transform. Several algorithms have been designed to learn such a transform directly from data,…
The nearest lattice point problem in $\mathbb{R}^n$ is formulated in a distributed network with $n$ nodes. The objective is to minimize the probability that an incorrect lattice point is found, subject to a constraint on inter-node…