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.

168,786 papers · 148 categories

Trend · papers per month

326495127 · Jun 202019922001200920172026
48 results for Visible Light Communications

New ML models improve VVLC channel characterization for vehicular OWC.

problem Inaccurate channel models for VVLC due to mobility effects.
method Machine learning (ML) models incorporating ambient light, turbulence, and reflection effects.
result ML models predict VVLC channel loss and CFR more accurately than existing methods.

Optimizes UAV deployment for VLC-enabled UAVs considering illumination distribution.

problem Optimizing UAV deployment for VLC-enabled UAVs with illumination distribution consideration.
method Formulated as an optimization problem, solved using GRUs and Gaussian mixture model.
result Achieves up to 22.1% reduction in transmit power compared to conventional methods.

Paper proposes a graph model for optimal AP deployment in indoor optical wireless networks.

problem Challenges in deploying optical wireless networks due to LoS requirement and limited range.
method Graph modeling approach to identify minimum number of APs and their optimal locations.
result Optimal deployment of APs ensures connectivity and minimizes interference in indoor environments.

In a densely populated city like Dhaka (Bangladesh), a growing number of high-rise buildings is an inevitable reality. However, they pose mental health risks for citizens in terms of detachment from natural light, sky view, greenery, and environmental landscapes. The housing economy and rent structure in different area…

2018-12-10abs ↗pdf ↗

Designs chiral photonic structures using machine learning for efficient optical properties.

problem Optimizing chiral photonic nanostructures for light-matter interactions.
method Evolutionary algorithm and neural network approach for rapid optimization.
result Frequency-dependent modification in reflected light's degree of circular polarization.

NCV uses neural networks to improve Monte Carlo integration.

problem Improving variance reduction in parametric Monte Carlo integration.
method NCV combines a normalizing flow and a neural network to approximate the integrand and solve the integral equation, with a neural importance sampler to estimate the difference.
result NCV achieves state-of-the-art performance in light transport simulation with reduced noise and negligible bias.

Study visibility properties of Kobayashi distance on unbounded domains.

problem Understanding visibility properties of Kobayashi distance on unbounded domains.
method Analyzing visibility properties in the context of Kobayashi hyperbolic domains, focusing on unbounded domains and their boundary behavior.
result Carathéodory-type extension theorem for biholomorphisms between planar domains, including infinitely-connected domains.

We show that the translation length of any parabolic isometry on a complete semi-uniformly visible CAT(0) space is always zero. As a consequence, we will classify the isometries on visible CAT(0) spaces in terms of translation lengths. We will also show that the moduli space M(Sg,n)\mathbb{M}(S_{g,n}) of surface Sg,nS_{g,n} o…

2013-02-06abs ↗pdf ↗

Mathematical framework for cooperative communication explains belief transmission.

problem Lack of understanding why cooperation enables effective belief transmission.
method Connection to optimal transport theory, deriving prior models, statistical interpretations, proofs of robustness and instability.
result Cooperative communication provably enables effective, robust belief transmission.

Recently, the visibility graph has been introduced as a novel view for analyzing time series, which maps it to a complex network. In this paper, we introduce new algorithm of visibility, "cross-visibility", which reveals the conjugation of two coupled time series. The correspondence between the two time series is mappe…

2013-01-06abs ↗pdf ↗

This article is devoted to the study of prime alternating +achiral knots. In the case of arborescent knots, we prove in +AAA Visibility Theorem 5.1, that the symmetry is visible on a certain projection (not necessarily minimal) and that it is realised by a homeomorphism of order 4. In the general case (arborescent or n…

2015-03-06abs ↗pdf ↗

Improved visibility forecasts using statistical post-processing.

problem Accurate and reliable predictions of visibility are crucial in aviation and transportation.
method Calibrated ensemble forecasts using locally, semi-locally, and regionally trained POLR and MLP classifiers.
result Post-processing improves forecast skill and POLR models outperform MLPs.

The visibility transformation embeds data position into signature features for efficient pattern recognition.

problem Embedding absolute position into signature features for efficient pattern recognition.
method The visibility transformation is put on a theoretical footing and used to embed absolute position into signature features efficiently.
result The generated feature set simplifies pattern recognition by accommodating nonlinear functions of absolute and relative values.

With the advent of GDPR, the domain of explainable AI and model interpretability has gained added impetus. Methods to extract and communicate visibility into decision-making models have become legal requirement. Two specific types of explanations, contrastive and counterfactual have been identified as suitable for huma…

2019-06-21abs ↗pdf ↗

The family of image visibility graphs (IVGs) have been recently introduced as simple algorithms by which scalar fields can be mapped into graphs. Here we explore the usefulness of such operator in the scenario of image processing and image classification. We demonstrate that the link architecture of the image visibilit…

2018-04-19abs ↗pdf ↗

The study shows that the visible range from a point on harmonic manifolds follows an exponential distribution.

problem Understanding the visible range from a point on harmonic manifolds.
method Analyzing Poisson Boolean models on harmonic manifolds, focusing on the geometric mechanism of tube volumes around geodesic segments.
result The visible range from a point on harmonic manifolds follows an exponential distribution.

We study relations of some classes of kk-convex, kk-visible bodies in Euclidean spaces. We introduce and study \textrm{circular projections} in normed linear spaces and classes of bodies related with families of such maps, in particular, \textrm{kk-circular convex} and \textrm{kk-circular visible} ones. Investigati…

2008-09-22abs ↗pdf ↗

A visible action on a complex manifold is a holomorphic action that admits a JJ-transversal totally real submanifold SS. It is said to be strongly visible if there exists an orbit-preserving anti-holomorphic diffeomorphism σσ such that σS=idσ|_S = \mathrm{id}. In this paper, we prove that for any Hermitian symmetric sp…

2006-06-30abs ↗pdf ↗

Paper proposes AggITD for efficient federated hypergradient computation.

problem Computing hypergradient in federated settings is challenging due to distributed and nonlinear construction of global Hessian matrices.
method AggITD: a novel communication-efficient federated hypergradient estimator via aggregated iterative differentiation.
result AggITD achieves the same sample complexity as AID-based approaches but with fewer communication rounds, especially in heterogeneous data environments.

The paper analyzes generalization of noisy iterative algorithms using communication theory.

problem Generalization of models trained by noisy iterative algorithms under different distributions.
method Connecting noisy iterative algorithms to additive noise channels in communication theory.
result Distribution-dependent generalization bounds for noisy iterative algorithms.

We show that the visible sector probability density function of the Riemann-Theta Boltzmann machine corresponds to a gaussian mixture model consisting of an infinite number of component multi-variate gaussians. The weights of the mixture are given by a discrete multi-variate gaussian over the hidden state space. This a…

2018-04-20abs ↗pdf ↗

The paper connects geodesic flows and limit sets on visibility manifolds.

problem Understanding dynamics and ergodic properties on non-compact visibility manifolds.
method Analyzing geodesic flows and Patterson-Sullivan measures on visibility manifolds without conjugate points.
result The positivity of the Patterson-Sullivan measure of the Myrberg limit set is equivalent to the conservativity of the geodesic flow.

In the age of globalization, it is natural that the stock market of each country is not independent form the other markets. In this case, collective behavior could be emerged form their dependency together. This article studies the collective behavior of a set of forty influential markets in the world economy with the …

2017-03-26abs ↗pdf ↗

GNNs robustness in community detection is studied with various perturbations.

problem Understanding GNNs robustness in community detection tasks.
method Systematic computational evaluation of six GNN architectures on synthetic and real-world networks.
result Supervised GNNs achieve higher baseline accuracy, while DMoN shows stronger resilience to perturbations.

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.

Paper uses SDP for community detection with side information.

problem Community detection in graphs with additional non-graph data.
method Formulates SDP relaxation for maximum likelihood node labeling with side information.
result SDP achieves same exact recovery threshold as maximum likelihood with side information.

Structural RBM reduces parameters for image denoising and classification.

problem High parameter count in RBMs limits their applicability to large datasets.
method Introduces SRBM with constrained connections to reduce parameters.
result SRBM achieves better performance and faster training than vanilla RBM.

Characterizes causal structure dominance for latent variables.

problem Determining dominance relations between causal structures with latent variables.
method Complete characterization for three visible variables, partial for four; uses nontrivial inequality constraints.
result Equivalence classes with nontrivial inequality constraints become ubiquitous as the number of visible variables increases.

Enhanced visibility forecasts using CAMS data improve accuracy.

problem Improving the accuracy of visibility predictions in weather forecasts.
method Statistical post-processing with historical observations and CAMS forecasts.
result Post-processed forecasts with CAMS data are substantially superior to raw and climatological predictions.

Proposes COLA, a communication-efficient algorithm for decentralized optimization.

problem Decentralized consensus optimization over a network.
method Linearization and communication-censoring strategy to reduce computation and communication costs.
result Proven convergence and established convergence rates for COLA.

Sunshine trading theory predicts lower execution costs and liquidity provision through explicit preannouncements, but evidence is scarce in traditional markets.

problem Adverse selection on liquidity provision
method Reconstructing metaorders and comparing them with visible TWAP executions
result Visible TWAPs face lower execution costs and leave a smaller permanent price impact compared to hidden metaorders.

Multi-view data are becoming common in real-world modeling tasks and many multi-view data clustering algorithms have thus been proposed. The existing algorithms usually focus on the cooperation of different views in the original space but neglect the influence of the hidden information among these different visible vie…

2019-08-12abs ↗pdf ↗