A Monte Carlo k-nearest neighbours (KNN) and a multi-resolution convolutional neural network (CNN) were developed to detect the presences of multiple gasses in near infrared (IR) spectrums. High Resolution Transmission database was used to synthesize the near IR spectrums. Monte Carlo KNN determined the optimal kernel …
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,695 papers · 148 categories
Trend · papers per month
48 results for “OPTIMAL RESOLUTION”
WrapNet optimizes inference for low-resolution neural networks by using 8-bit additions.
problem Reducing multiplication complexity in low-resolution neural networks.
method Adapting neural networks to use low-resolution (8-bit) additions in accumulators, with a cyclic activation layer and overflow penalty regularizer.
result Achieves comparable classification accuracy to 32-bit counterparts using low-resolution additions.
Recently M. Kreck introduced a class of stratified spaces called p-stratifolds [M. Kreck, Stratifolds, Preprint]. He defined and investigated resolutions of p-stratifolds analogously to resolutions of algebraic varieties. In this note we study a very special case of resolutions, so called optimal resolutions, for p-str…
Deep learning improves 3D microscopy resolution without matched target images.
problem Anisotropic resolution in volumetric fluorescence microscopy.
method Cycle-consistent generative adversarial network trained on unpaired 2D images.
result Enhanced axial resolution and restored details between imaging planes.
Solve for the Hyperparameter, Skip the Search: Kolmogorov-Optimal Scaling Laws for Spline Regressioncs.LG
KOLMOGOROV-OPTIMAL RESOLUTION ESTIMATION (KORE) solves spline regression without exhaustive search
problem Hyperparameter tuning in spline regression
method Solving for optimal resolution analytically
result KORE matches exhaustive cross-validation and outperforms tuned models
Locally-adapted convolution-based super-resolution of irregularly-sampled ocean remote sensing datastat.ML
Super-resolution is a classical problem in image processing, with numerous applications to remote sensing image enhancement. Here, we address the super-resolution of irregularly-sampled remote sensing images. Using an optimal interpolation as the low-resolution reconstruction, we explore locally-adapted multimodal conv…
One significant challenge to scaling entity resolution algorithms to massive datasets is understanding how performance changes after moving beyond the realm of small, manually labeled reference datasets. Unlike traditional machine learning tasks, when an entity resolution algorithm performs well on small hold-out datas…
We study first-order optimization methods obtained by discretizing ordinary differential equations (ODEs) corresponding to Nesterov's accelerated gradient methods (NAGs) and Polyak's heavy-ball method. We consider three discretization schemes: an explicit Euler scheme, an implicit Euler scheme, and a symplectic scheme.…
New unsupervised deep learning method improves temporal resolution in tMRA.
problem Limited temporal resolution in tMRA due to fixed view-sharing scheme.
method Optimal transport driven cycle-consistent generative adversarial network (cycleGAN) without fully sampled k-space reference data.
result Can generate high quality reconstructions at various temporal resolutions.
New insights into RL efficiency from managing time discretization.
problem The impact of time discretization on RL methods in continuous-time systems.
method Analysis of Monte-Carlo policy evaluation for LQR systems.
result An optimal choice of temporal resolution for a given data budget improves policy evaluation efficiency.
Hyperspectral remote sensing images (HSIs) are characterized by having a low spatial resolution and a high spectral resolution, whereas multispectral images (MSIs) are characterized by low spectral and high spatial resolutions. These complementary characteristics have stimulated active research in the inference of imag…
This research accelerates sampling methods using Nesterov's Acceleration.
problem Improving sampling efficiency in MCMC methods.
method Developed a Hessian-Free High-Resolution ODE reformulation of NAG-SC, injected noise, and discretized the diffusion process.
result Quantified acceleration beyond underdamped Langevin in distance for log-strongly-concave targets.
With the fast growth in the visual surveillance and security sectors, thermal infrared images have become increasingly necessary ina large variety of industrial applications. This is true even though IR sensors are still more expensive than their RGB counterpart having the same resolution. In this paper, we propose a d…
Hyperspectral remote sensing images (HSIs) usually have high spectral resolution and low spatial resolution. Conversely, multispectral images (MSIs) usually have low spectral and high spatial resolutions. The problem of inferring images which combine the high spectral and high spatial resolutions of HSIs and MSIs, resp…
The study optimizes Gaussian process approximations for finite-rank models.
problem Posterior behavior of finite-rank approximations differs from parent GP priors.
method Locally supported basis expansions with dependent Gaussian coefficients.
result Finite-rank expansions inherit the same posterior contraction rate as parent GP priors.
Many graph clustering quality functions suffer from a resolution limit, the inability to find small clusters in large graphs. So called resolution-limit-free quality functions do not have this limit. This property was previously introduced for hard clustering, that is, graph partitioning. We investigate the resolution-…
Improved score-based models generate high-quality images up to 256x256.
problem Training score-based models for high-resolution images is unstable and limited.
method Theoretical analysis, exponential moving average of model weights.
result Score-based models can generate high-fidelity images up to 256x256.
Mapping Low-Resolution Images To Multiple High-Resolution Images Using Non-Adversarial Mappingeess.IV
SR-NAM maps low-res images to multiple high-res images realistically.
problem Mapping low-resolution images to multiple high-resolution images realistically.
method SR-NAM using Non-Adversarial Mapping (NAM) technique and a degradation model.
result Realistic degradation and down-sampling of high-resolution images.
Background: Three-dimensional, whole heart, balanced steady state free precession (WH-bSSFP) sequences provide delineation of intra-cardiac and vascular anatomy. However, they have long acquisition times. Here, we propose significant speed ups using a deep learning single volume super resolution reconstruction, to reco…
SC-Net learns interpretable filters for inverse problems, achieving optimal convergence and super-resolution.
problem Solving ill-posed inverse problems with effective regularization and interpretability.
method SC-Net operates in the spectral domain, learning a pointwise adaptive filter function based on signal-to-noise ratio.
result SC-Net achieves optimal convergence rate and zero-shot super-resolution, matching theoretical bounds.
This paper develops a new deep neural network optimized equalization framework for massive multiple input multiple output orthogonal frequency division multiplexing (MIMOOFDM) systems that employ low-resolution analog-to-digital converters (ADCs) at the base station (BS). The use of lowresolution ADCs could largely red…
Learning Time Series from Scale Informationcond-mat.mes-hall
Proposes a method to predict time series data using scale information.
problem Sequential data exhibits different behavior at different scales.
method Scale-based inference using -nearest neighbors and sequential prediction.
result Asymptotically, the algorithm produces the best prediction error.
Single image super-resolution is the task of inferring a high-resolution image from a single low-resolution input. Traditionally, the performance of algorithms for this task is measured using pixel-wise reconstruction measures such as peak signal-to-noise ratio (PSNR) which have been shown to correlate poorly with the …
Gradient-based optimization algorithms can be studied from the perspective of limiting ordinary differential equations (ODEs). Motivated by the fact that existing ODEs do not distinguish between two fundamentally different algorithms---Nesterov's accelerated gradient method for strongly convex functions (NAG-SC) and Po…
Transforms game optimization dynamics into frequency domain for precise hyperparameter analysis.
problem Analyzing convergence of hyperparameters in game optimization.
method Frequency-domain framework using High-Resolution Differential Equations (HRDEs) and Laplace transforms.
result Derives precise convergence criteria for the Lookahead algorithm.
This study prioritizes temporal resolution over spatial in energy systems models due to higher influence.
problem The impact of spatial and temporal resolution on energy system models.
method Global sensitivity analysis to compare structural aspects, spatial, and temporal resolution.
result Temporal resolution has a higher influence on all results parameters compared to spatial resolution.
There are 2^n possible resolutions of a smooth pseudodiagram with n precrossings. If we consider piecewise-linear (PL) pseudodiagrams and resolutions that themselves are PL, certain resolutions of the pseudodiagram may not exist in three-space. We investigate this situation and its impact on the weighted resolution set…
Tensor decomposition, a collection of factorization techniques for multidimensional arrays, are among the most general and powerful tools for scientific analysis. However, because of their increasing size, today's data sets require more complex tensor decomposition involving factorization with multiple matrices and dia…
Many real-world phenomena are observed at multiple resolutions. Predictive models designed to predict these phenomena typically consider different resolutions separately. This approach might be limiting in applications where predictions are desired at fine resolutions but available training data is scarce. In this pape…
High-resolution signal recovery via generalized sampling and functional principal component analysismath.ST
The paper presents a method to recover high-resolution signals from low-resolution measurements.
problem Recovering high-resolution signals from low-resolution indirect measurements.
method Combining generalized sampling and functional principal component analysis.
result High-resolution recovery is possible under certain conditions and with a sufficiently large training set.
Recently, several models based on deep neural networks have achieved great success in terms of both reconstruction accuracy and computational performance for single image super-resolution. In these methods, the low resolution (LR) input image is upscaled to the high resolution (HR) space using a single filter, commonly…
Despite the breakthroughs in accuracy and speed of single image super-resolution using faster and deeper convolutional neural networks, one central problem remains largely unsolved: how do we recover the finer texture details when we super-resolve at large upscaling factors? The behavior of optimization-based super-res…
A resolution of the St. Petersburg paradox is presented. In contrast to the standard resolution, utility is not required. Instead, the time-average performance of the lottery is computed. The final result can be phrased mathematically identically to Daniel Bernoulli's resolution, which uses logarithmic utility, but is …
The `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type is proved in the context of manifolds with corners. This procedure is shown to capture the simultaneous resolution of all isotropy types in a `resolution tower' which projects …
ElbowSig assesses clustering structure at multiple scales.
problem Selecting optimal number of clusters in unsupervised learning.
method Formalizes elbow heuristic with a normalized discrete curvature statistic.
result Validates multiscale clustering structure over various resolutions.
Study contact resolutions for Jacobi structures, providing examples and impossibility results.
problem Understanding contact resolutions of Jacobi structures.
method Examining various classes of Jacobi structures and their contact properties.
result Identified conditions under which contact resolutions exist and those where they do not.
Running high-resolution physical models is computationally expensive and essential for many disciplines. Agriculture, transportation, and energy are sectors that depend on high-resolution weather models, which typically consume many hours of large High Performance Computing (HPC) systems to deliver timely results. Many…
VISION-XL improves HD video quality using latent image diffusion models.
problem Improving high-definition video quality and resolution.
method Latent image diffusion models and pseudo-batch consistent sampling.
result State-of-the-art video reconstruction across various inverse problems.
NKN deep neural network learns governing equations and classifies images.
problem Learning governing equations and classifying images with deep neural networks.
method Nonlocal kernel network (NKN) that is resolution independent, deep, and handles various tasks.
result NKN outperforms baseline methods in learning governing equations and image classification tasks.
EnScale: Temporally-consistent multivariate generative downscaling via proper scoring rulesphysics.ao-ph
EnScale learns to downscale climate models efficiently, capturing both spatial and temporal consistency.
problem Downscaling climate models from coarse to high-resolution data is computationally expensive and challenging.
method EnScale uses generative models and proper scoring rules to map GCM data to RCM data, reducing computational cost.
result EnScale achieves competitive performance and computational efficiency in downscaling multiple climate variables.
This paper simplifies diffusion models for high resolution images.
problem Applying diffusion models to high resolution images is challenging.
method Adjust noise schedule, scale specific parts, add dropout, and use downsampling.
result Achieved state-of-the-art image generation performance.
A refined form of the `Folk Theorem' that a smooth action by a compact Lie group can be (canonically) resolved, by iterated blow up, to have unique isotropy type was established by the authors in the context of manifolds with corners; the canonical construction induces fibrations on the boundary faces of the resolution…
Some Poisson structures do admit resolutions by symplectic manifolds of the same dimension. We give examples and simple conditions under which such resolutions can not exist.
The shortage of high-resolution urban digital elevation model (DEM) datasets has been a challenge for modelling urban flood and managing its risk. A solution is to develop effective approaches to reconstruct high-resolution DEMs from their low-resolution equivalents that are more widely available. However, the current …
New deep learning method improves 4D Flow MRI super-resolution under domain shift.
problem Domain shift in low-resolution 4D Flow MRI data.
method Distributional deep learning framework for domain generalization.
result Framework significantly outperforms traditional methods in real data applications.
Training a deep neural network for classification constitutes a major problem in remote sensing due to the lack of adequate field data. Acquiring high-resolution ground truth (GT) by human interpretation is both cost-ineffective and inconsistent. We propose, instead, to utilize high-resolution, hyperspectral images for…
Obtaining magnetic resonance images (MRI) with high resolution and generating quantitative image-based biomarkers for assessing tissue biochemistry is crucial in clinical and research applications. How- ever, acquiring quantitative biomarkers requires high signal-to-noise ratio (SNR), which is at odds with high-resolut…
Generates high-resolution images from low-resolution inputs.
problem Generating realistic images from low-resolution inputs.
method Latent Adversarial Generator (LAG) using perceptual loss.
result Samples of high-resolution images from low-resolution inputs.