Research
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.

169,051 papers · 148 categories

Trend · papers per month

62123185246 · Jun 202019922001200920182026
48 results for low light

Study subjective perception of low light restored images and develop an unsupervised QA model.

problem Lack of subjective QA for low light restored images and challenges in collecting human opinion scores.
method Create a dataset, conduct subjective QA study, develop self-supervised contrastive learning technique to extract features.
result Unsupervised NR QA model achieves state-of-the-art performance for low light restored images.

Physen-Noise2Noise tackles defocus deblurring in low-light conditions with physics-guided self-supervised learning.

problem Defocus deblurring in low-light conditions with complex biased noise.
method Physics-guided self-supervised deblurring framework that leverages noisy multi-frame observations and a learnable noise bias parameter.
result Physen-Noise2Noise consistently outperforms state-of-the-art methods in defocus deblurring with complex biased noise.

Let (Xm+1,g)(X^{m+1}, g) be a globally hyperbolic spacetime with Cauchy surface diffeomorphic to an open subset of Rm\mathbb R^m. The Legendrian Low conjecture formulated by Natário and Tod says that two events x,yßx,y\inß are causally related if and only if the Legendrian link of spheres Sx,Sy\mathfrak S_x, \mathfrak S_y whose p…

2008-10-28abs ↗pdf ↗

Adds a precortical module to CNNs for improved robustness to light variations.

problem Robustness of CNNs to global light intensity and contrast variations.
method Developed a mathematical model of the mammalian visual pathway, inspired by CNNs, and added a preliminary convolutional module.
result Significantly more robust CNNs achieved with added module on MNIST, FashionMNIST, and SVHN databases.

Noise is an inherent issue of low-light image capture, one which is exacerbated on mobile devices due to their narrow apertures and small sensors. One strategy for mitigating noise in a low-light situation is to increase the shutter time of the camera, thus allowing each photosite to integrate more light and decrease n…

2017-12-15abs ↗pdf ↗

We study the low-regularity (in-)extendibility of spacetimes within the synthetic-geometric framework of Lorentzian length spaces developed in [KS:17]. To this end, we introduce appropriate notions of geodesics and timelike geodesic completeness and prove a general inextendibility result. Our results shed new light on …

2018-04-27abs ↗pdf ↗

We propose an automatic method to infer high dynamic range illumination from a single, limited field-of-view, low dynamic range photograph of an indoor scene. In contrast to previous work that relies on specialized image capture, user input, and/or simple scene models, we train an end-to-end deep neural network that di…

2017-04-01abs ↗pdf ↗

The moduli space of Riemann surfaces with at least two punctures can be decomposed into a cell complex by using a particular family of ribbon graphs called Nakamura graphs. We distinguish the moduli space with all punctures labelled from that with a single labelled puncture. In both cases, we describe a cell decomposit…

2015-07-10abs ↗pdf ↗

Enhances 2D face recognition with 3D features using active illumination.

problem Improving robustness of 2D face recognition to spoofing attacks and low-light conditions.
method Projecting a high spatial frequency pattern onto the face to recover 3D information and a 2D image simultaneously.
result Significantly boosts face recognition performance and dramatically improves robustness to spoofing attacks.

ROTS improves sentence similarity by incorporating structural information.

problem Measuring sentence similarity with theoretical insights and structural awareness.
method Recursive Optimal Transport (ROT) framework to incorporate structural information.
result ROTS outperforms weakly supervised approaches in sentence similarity tasks.

This paper investigates the theoretical foundations of metric learning, focused on three key questions that are not fully addressed in prior work: 1) we consider learning general low-dimensional (low-rank) metrics as well as sparse metrics; 2) we develop upper and lower (minimax)bounds on the generalization error; 3) w…

2017-09-18abs ↗pdf ↗

In this paper, we propose a general framework for sparse and low-rank tensor estimation from cubic sketchings. A two-stage non-convex implementation is developed based on sparse tensor decomposition and thresholded gradient descent, which ensures exact recovery in the noiseless case and stable recovery in the noisy cas…

2018-01-29abs ↗pdf ↗

New model enhances SPIM for solving low-rank combinatorial optimization and statistical learning problems.

problem Solving large-scale combinatorial optimization problems efficiently.
method Proposed a new computing model for SPIM that can handle low-rank interaction matrices.
result Demonstrated efficient learning, classification, and sampling of MNIST images using the model.

Novel approach embeds loss tunnels in neural networks, revealing insights into their structure.

problem Understanding the structure of neural network loss surfaces, especially low-loss tunnels.
method Directly embedding loss tunnels into the loss landscape of neural networks.
result Improved insights into the length and structure of loss tunnels, and better subspace inference in Bayesian neural networks.

A new method for active learning works well across all label budgets.

problem Active learning methods perform poorly in both low and high label budgets.
method Uncertainty Herding: a simple, computationally fast method that optimizes uncertainty coverage.
result Uncertainty Herding nearly optimizes distribution-level coverage and performs well across various active learning tasks.

This paper proposes a fast and accurate method for sparse regression in the presence of missing data. The underlying statistical model encapsulates the low-dimensional structure of the incomplete data matrix and the sparsity of the regression coefficients, and the proposed algorithm jointly learns the low-dimensional s…

2015-03-28abs ↗pdf ↗

Enhances nighttime vehicle detection using style transfer and augmentation.

problem Nighttime object detection challenges due to lack of lighting and glare.
method Day-to-night style transfer and labeling-free augmentation with CARLA synthetic data.
result Significant improvements in nighttime vehicle detection with YOLO11 model.

We simplify SSL by approximating redundant structural components with low-rank factorization.

problem Improving self-supervised learning performance with limited labeled data.
method Low-rank approximation of structural redundancy, introducing ε_s to measure approximation quality.
result The proposed method enhances SSL performance, as shown by theoretical and experimental validations.

Improved convergence for overparameterized low-rank matrix sensing.

problem Overparameterized low-rank matrix sensing with unknown rank and ill-conditioning.
method ScaledGD(λλ) - preconditioned gradient descent method.
result ScaledGD(λλ) converges at a constant linear rate after a logarithmic number of iterations.

Proposes a new model for image restoration combining deep learning and total variation.

problem Restoring images from limited data with low-rank constraints insufficient.
method Regularized Deep Matrix Factorized (RDMF) model using deep neural network's low-rank bias and total variation.
result Outperforms state-of-the-art models in image restoration from few observations.

Using open source data, we observe the fascinating dynamics of nighttime light. Following a global economic regime shift, the planetary center of light can be seen moving eastwards at a pace of about 60 km per year. Introducing spatial light Gini coefficients, we find a universal pattern of human settlements across dif…

2013-03-12abs ↗pdf ↗

Deep learning and prior maps improve traffic light recognition for autonomous cars.

problem Recognizing traffic lights for autonomous cars in urban environments.
method Combining deep learning-based detection with prior maps for traffic light identification and state recognition.
result The proposed system correctly identified relevant traffic lights along predefined routes.

The problem of Poisson denoising appears in various imaging applications, such as low-light photography, medical imaging and microscopy. In cases of high SNR, several transformations exist so as to convert the Poisson noise into an additive i.i.d. Gaussian noise, for which many effective algorithms are available. Howev…

2013-09-17abs ↗pdf ↗

Deep neural networks often fit low-frequency functions, contrary to conventional numerical schemes.

problem Understanding the implicit bias of deep neural networks in fitting training data.
method Fourier analysis perspective applied to DNNs training process.
result Deep neural networks tend to fit training data by low-frequency functions, contrary to conventional numerical schemes.

Solves surface problem in 3D light cone.

problem Björling problem for zero mean curvature surfaces in the three-dimensional light cone.
method Solves the Björling problem for zero mean curvature surfaces in the three-dimensional light cone.
result Constructs and classifies all rotational zero mean curvature surfaces.

Study light ray transform on Lorentzian manifolds without conjugate points.

problem Recovering spacelike singularities from weighted light ray transforms.
method Fourier Integral Operator analysis and filtered back-projection.
result Recovery of spacelike singularities from weighted light ray transforms without conjugate points.

Paper extends previous result on hypersurfaces with degenerate light-like points.

problem Characterizing hypersurfaces with degenerate light-like points in Lorentzian manifolds.
method Analyzes C3C^3-differentiable hypersurfaces, extending previous C4C^4-differentiability result.
result Same conclusion holds for C3C^3-differentiable hypersurfaces as for C4C^4-differentiable ones.

New algorithm reduces RL complexity with low switching costs.

problem Exploration-exploitation dilemma in RL with complex models.
method Monotonic Q-Learning with Upper Confidence Bound (MQL-UCB) for RL with general function approximation.
result Achieves minimax optimal regret of O(dHK)O(d\sqrt{HK}) and near-optimal policy switching cost.

The natural topological, differentiable and geometrical structures on the space of light rays of a given spacetime are discussed. The relation between the causality properties of the original spacetime and the natural structures on the space of light rays are stressed. Finally, a symplectic geometrical approach to the …

2015-10-28abs ↗pdf ↗

Consider a constant mean curvature immersion F:U(Rn)MF:U(\subset \boldsymbol{R}^n)\to M into an arbitrary Lorentzian (n+1)(n+1)-manifold MM. A point oUo\in U is called a light-like point if the first fundamental form ds2ds^2 of FF degenerates at oo. We denote by BFB_F the determinant function of the symmetric matrix associate…

2018-06-24abs ↗pdf ↗

Develops efficient method for updating models with small data changes.

problem Efficiently updating models when data changes (e.g., adding/removing instances/features).
method Generalized Low-Rank Update (GLRU) for non-linear estimators.
result Provides updated solutions with computational complexity proportional to dataset changes.

The paper explores the injectivity of the light ray transform on Lorentzian manifolds.

problem Injectivity of the light ray transform on functions and tensors.
method Analyzes injectivity conditions for scalar and tensor fields on stationary and static Lorentzian manifolds.
result Injectivity of the light ray transform on functions and tensors is proven under specific conditions.

In this paper, we are concerned with light-like extremal surfaces in curved spacetimes. It is interesting to find that under a diffeomorphic transformation of variables, the light-like extremal surfaces can be described by a system of nonlinear geodesic equations. Particularly, we investigate the light-like extremal su…

2013-05-04abs ↗pdf ↗

Designing models that are robust to small adversarial perturbations of their inputs has proven remarkably difficult. In this work we show that the reverse problem---making models more vulnerable---is surprisingly easy. After presenting some proofs of concept on MNIST, we introduce a generic tilting attack that injects …

2018-06-19abs ↗pdf ↗