Article presents QR and LQ decomposition algorithms for various matrix sizes and ranks.
problem Solving least squares problems in machine learning and computer vision.
method Developed novel matrix backpropagation algorithms for QR and LQ decompositions of different matrix sizes and ranks.
result Numerical stability and computational efficiency of the proposed methods.
We orthogonalize the NSS model to condition and diagnose its ill-conditioned parameters.
problem The ill-conditioning of the NSS model's design matrix.
method Exact orthogonal reparametrization via QR decomposition.
result Orthogonalization isolates the conditioning structure and maintains fit uncertainty.
QR-MIX models joint state-action values as a distribution to handle randomness in MARL.
problem Randomness in rewards and observations leads to randomness in long-term returns in MARL.
method QR-MIX uses quantile regression and combines it with QMIX and IQN to model joint state-action values as a distribution.
result QR-MIX outperforms QMIX in the StarCraft Multi-Agent Challenge (SMAC) environment.
ABO extends RLS for online learning in non-stationary time-series, improving accuracy and speed.
problem Online learning in non-stationary time-series with overparameterized models.
method QR-based exponentially weighted RLS algorithm with orthogonal-triangular updates.
result ABO maintains bounded residuals and stable condition numbers while achieving speed improvements.
In this note we prove that QR-submanifolds of the hyper-Kahler manifolds under some conditions admit the G2 holonomy. We give simplest examples of such QR-submanifolds namely tori. We conjecture that all G2 holonomy manifolds arise in this way.
Canonical Correlation Analysis (CCA) is a widely used statistical tool with both well established theory and favorable performance for a wide range of machine learning problems. However, computing CCA for huge datasets can be very slow since it involves implementing QR decomposition or singular value decomposition of h…
Spectral method for joint community detection and group synchronization.
problem Jointly detecting communities and synchronizing orthogonal groups in graphs.
method Spectral decomposition followed by CPQR factorization.
result Near-optimal guarantees for exact and stable recovery of cluster memberships and orthogonal transforms.
New algorithm reduces matrix multiplication time for sparse matrices.
problem Efficiently multiply large sparse matrices with limited space.
method Exploits sparsity to reduce QR decompositions and time complexity.
result Time complexity reduced to $\widetilde{O}\left((
nz(X)+
nz(Y))\ell+n\ell^2
ight)$ in expectation.
In this paper we study 3-submersions from a QR-hypersurface of a quaternionic Kaehler manifold onto an almost quaternionic hermitian manifold. We also prove the non-existence of quaternionic submersions between quaternionic Kaehler manifolds which are not locally hyper-Kaehler.
This paper studies the inference problem in quantile regression (QR) for a large sample size n but under a limited memory constraint, where the memory can only store a small batch of data of size m. A natural method is the naïve divide-and-conquer approach, which splits data into batches of size m, computes the l…
In distributional reinforcement learning (RL), the estimated distribution of value function models both the parametric and intrinsic uncertainties. We propose a novel and efficient exploration method for deep RL that has two components. The first is a decaying schedule to suppress the intrinsic uncertainty. The second …
NS-RGS improves orthogonal group synchronization with faster convergence.
problem Orthogonal group synchronization from pairwise measurements.
method Newton-Schulz iteration for Riemannian gradient optimization.
result NS-RGS achieves linear convergence and near-optimal accuracy.
The space of probability densities is an infinite-dimensional Riemannian manifold, with Riemannian metrics in two flavors: Wasserstein and Fisher--Rao. The former is pivotal in optimal mass transport (OMT), whereas the latter occurs in information geometry---the differential geometric approach to statistics. The Rieman…
Discrete normal surfaces are normal surfaces whose intersection with each tetrahedron of a triangulation has at most one component. They are also natural Poincaré duals to 1-cocycles with $\ZZ/2\ZZ$-coefficients. For a fixed cohomology class in a simplicial poset the average Euler characteristic of the associated discr…
This work connects Cramér distance to QR-DQN for DRL.
problem Improving performance in DRL by capturing full distribution of returns.
method Proves Cramér distance's equivalence to 1-Wasserstein distance and proposes a low-complexity algorithm to compute Cramér distance.
result Cramér distance and quantile regression losses yield collinear gradients under non-crossing constraints.
EX-DRL improves extreme quantile prediction for financial risk management.
problem Inaccurate estimation of extreme quantiles in loss distributions.
method EX-DRL uses Generalized Pareto Distribution (GPD) to model the tail of the loss distribution and Quantile Regression (QR) to improve extreme quantile prediction.
result EX-DRL provides more precise estimates of extreme quantiles, improving risk metrics reliability.
Proposes a deep learning method to ensure non-crossing quantiles in conditional distributions.
problem Non-crossing quantiles issue in deep learning QR models.
method Generic deep learning algorithm enforcing quantile monotonicity.
result Ensures non-crossing quantiles up to machine precision.
QR-learner estimates individual treatment effects using external data.
problem Limited power to detect individual treatment effects in randomized trials.
method Model-agnostic learner that estimates conditional average treatment effects (CATE) using external data.
result QR-learner reduces mean squared error and can recover true CATE.
We describe an effective method for simultaneously computing of d-invariants of infinite families of Brieskorn spheres Σ(p,q,r) with pq+pr−qr=1.
TCP provides well-calibrated prediction intervals for nonstationary time series.
problem Nonstationary time series forecasting with well-calibrated prediction intervals.
method Temporal Conformal Prediction (TCP) couples a modern quantile forecaster with a rolling split-conformal calibration layer.
result TCP achieves near-nominal coverage, providing slightly wider intervals than Historical Simulation.
Hutch++ optimizes trace estimation for generative models, reducing variance and improving quality.
problem High variance and scalability issues in Hutchinson estimators for generative models.
method Hutch++ is an optimal stochastic trace estimator designed to minimize training variance while maintaining transport optimality.
result Hutch++ leads to higher quality generations and effective variance reduction in various applications.
New method for valid prediction sets in high-dimensional covariate shifts.
problem Valid prediction sets in high-dimensional covariate shifts.
method Likelihood-ratio regularized quantile regression (LR-QR) algorithm.
result LR-QR constructs valid prediction sets with desired coverage in target domain.
New method differentiates square-root Kalman filters robustly.
problem Gradient calculation issues in square-root Kalman filters.
method Closed-form chain rule derived from Gramian identity, resolves non-orthogonal and rank-deficient issues.
result Robust automatic differentiation for Kalman filters, resolving numerical stability and gradient issues.
Optimal inference in distributed quantile regression without stringent scaling conditions.
problem Challenges in achieving optimal inference in distributed quantile regression due to the non-smooth nature of the QR loss function.
method Double-smoothing approach applied to local and global objective functions, with a trade-off between communication cost and statistical error.
result Established a finite-sample theoretical framework for distributed QR estimators, showing a trade-off between communication cost and statistical error.
A deep learning algorithm for ECG segmentation.
problem ECG signal segmentation for various sampling rates and monitors.
method UNet-like neural network for adaptive and generalized ECG segmentation.
result F1-measures for ECG segmentation are at least 97.8%, 99.5%, and 99.9%.
Revisits PCA with new formulations and insights.
problem Improving PCA formulations and understanding.
method Difference-of-convex (DC) framework, kernelizability, out-of-sample applicability, simultaneous iteration, DCA perspective.
result PCA-like problems are kernelizable and have new optimization perspectives.
The Nystrom method is a popular technique that uses a small number of landmark points to compute a fixed-rank approximation of large kernel matrices that arise in machine learning problems. In practice, to ensure high quality approximations, the number of landmark points is chosen to be greater than the target rank. Ho…
Study uses APT and QR to identify risk factors affecting crude oil returns.
problem Determining the risk factors impacting crude oil returns.
method Employed Arbitrage Pricing Theory and Quantile Regression.
result Identified key risk factors: industrial production, inflation, energy prices, yield curve shape, and economic policy uncertainty.
We shed new insights on the two commonly used updates for the online k-PCA problem, namely, Krasulina's and Oja's updates. We show that Krasulina's update corresponds to a projected gradient descent step on the Stiefel manifold of the orthonormal k-frames, while Oja's update amounts to a gradient descent step using…
This work extends VQR to non-linear cases and provides scalable solvers.
problem Limitations of VQR in handling non-linear relationships and scalability.
method Extension to non-linear VQR, vector monotone rearrangement, fast solvers.
result Substantial improvement over linear VQR and scalable solvers.
Learning an effective representation for high-dimensional data is a challenging problem in reinforcement learning (RL). Deep reinforcement learning (DRL) such as Deep Q networks (DQN) achieves remarkable success in computer games by learning deeply encoded representation from convolution networks. In this paper, we pro…
Develops new algorithms for QRF to handle mixed-frequency and longitudinal data.
problem Handling mixed-frequency and longitudinal data in quantile regression.
method Mixed-Frequency Quantile Regression Forest (MIDAS-QRF) and Finite Mixture Quantile Regression Forest (FM-QRF).
result Valid and flexible models for complex empirical settings in financial risk management and climate-change impact evaluation.
Motivated by the need for effectively summarising, modelling, and forecasting the distributional characteristics of intra-daily returns, as well as the recent work on forecasting histogram-valued time-series in the area of symbolic data analysis, we develop a time-series model for forecasting quantile-function-valued (…
Improved tensor GLM estimation for complex data.
problem Complex tensor data in GLMs leads to high-dimensional, ill-posed estimation.
method Proposed LSRTR-M algorithm using Muon updates for faster convergence and lower errors.
result LSRTR-M converges faster and achieves lower errors than LSRTR.
Paper tackles joint community detection and phase synchronization in stochastic block models.
problem Jointly recover cluster structure and phase angles in stochastic block models.
method Proposes two algorithms: a spectral method based on multi-frequency QR factorization and an iterative multi-frequency generalized power method.
result Proposed algorithms significantly improve recovery of cluster structure and phase angles compared to existing methods.
The paper studies topological and dynamic properties of boundaries in geometric group actions.
problem Understanding the topological and dynamic properties of boundaries in geometric group actions.
method Developed and studied sublinearly Morse and quasi-redirecting boundaries for proper geodesic spaces with geometric group actions.
result Proved that the action of a group on the boundaries is minimal and that the boundaries are topological spaces.
AuON is a linear-time optimizer that improves upon Muon's performance without approximate orthogonal matrices.
problem High memory and computational costs of orthogonal momentum updates.
method AuON uses normalized nonlinear scaling and a 'emergency brake' to handle exploding attention logits.
result AuON achieves strong performance without approximate orthogonal matrices, preserving structural alignment and reconditioning.
We showcase how Quantile Regression (QR) can be applied to forecast financial returns using Limit Order Books (LOBs), the canonical data source of high-frequency financial time-series. We develop a deep learning architecture that simultaneously models the return quantiles for both buy and sell positions. We test our mo…
Realizations of stochastic process are often observed temporal data or functional data. There are growing interests in classification of dynamic or functional data. The basic feature of functional data is that the functional data have infinite dimensions and are highly correlated. An essential issue for classifying dyn…
The implementation of conventional sparse principal component analysis (SPCA) on high-dimensional data sets has become a time consuming work. In this paper, a series of subspace projections are constructed efficiently by using Household QR factorization. With the aid of these subspace projections, a fast deflation meth…
Paper proposes a deep learning model for real-time ECG signal segmentation.
problem Real-time analysis of large ECG datasets for tele-health monitoring.
method Combines CNN and LSTM for detecting heartbeats' waveforms.
result Achieved high sensitivity and precision in QRS detection.
New algorithms improve uncertainty estimation in satellite precipitation predictions.
problem Lack of uncertainty estimates in machine learning spatial precipitation predictions from satellite data.
method Benchmarked six algorithms including LightGBM, compared using quantile scoring functions and rules.
result LightGBM outperformed other algorithms in quantile scoring rule by 11.10%.
Neural networks have been criticized for their lack of easy interpretation, which undermines confidence in their use for important applications. Here, we introduce a novel technique, interpreting a trained neural network by investigating its flip points. A flip point is any point that lies on the boundary between two o…
New method estimates extreme outcomes in heavy-tailed data, breaking circular dependence.
problem Estimating outcomes for extreme events in heavy-tailed data.
method Proposes an ADRF estimator that includes a structured tail-shape output and a diagnostic to evaluate tail shape.
result Successfully reduces MAE in deep-tail and conditional-shortfall predictions.
In this article, we prove that the equation of the Schrödinger maps from R2 to the hyperbolic 2-space H2 is SU(1,1)-gauge equivalent to the following 1+2 dimensional nonlinear Schrödinger-type system of unknown three complex functions p,q,r and a real function u: {c} iq_t+q_{z{\bar z}}-2u q+2({\ba…
Audit shows risk claims from distributional reinforcement learning agents are often false.
problem Evaluating the risk claims made by distributional reinforcement learning agents.
method Combines a decision-relevant screening metric, ground truth from Monte Carlo, and statistical methods to audit risk claims.
result 40-95% of the strongest risk claims are refuted, indicating the learned risk reflects a training artifact rather than environment stochasticity.
We study geodesic equations for a family of right-invariant Riemannian metrics on the group of diffeomorphisms of a compact manifold. The metrics descend to Fisher's information metric on the space of smooth probability densities. The right reduced geodesic equations are higher-dimensional generalisations of the μ--H…
A new retraction on Stiefel manifold with a closed-form inverse.
problem Efficiency in Riemannian computing applications.
method Introduces a new retraction on the compact Stiefel manifold with a closed-form inverse.
result The retraction is second-order accurate and features a closed-form inverse.