LightLoc: Learning Outdoor LiDAR Localization at Light Speed

• URL: http://arxiv.org/abs/2503.17814v1
• Date: Sat, 22 Mar 2025 16:33:41 GMT
• Title: LightLoc: Learning Outdoor LiDAR Localization at Light Speed
• Abstract summary: Scene coordinate regression achieves impressive results in outdoor LiDAR localization but requires days of training.<n>Long training times make these methods impractical for time-sensitive applications, such as autonomous driving, drones, and robotics.<n>We propose LightLoc, the first method capable of efficiently learning localization in a new scene at light speed.
• Score: 31.219354381187465
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Scene coordinate regression achieves impressive results in outdoor LiDAR localization but requires days of training. Since training needs to be repeated for each new scene, long training times make these methods impractical for time-sensitive applications, such as autonomous driving, drones, and robotics. We identify large coverage areas and vast data in large-scale outdoor scenes as key challenges that limit fast training. In this paper, we propose LightLoc, the first method capable of efficiently learning localization in a new scene at light speed. LightLoc introduces two novel techniques to address these challenges. First, we introduce sample classification guidance to assist regression learning, reducing ambiguity from similar samples and improving training efficiency. Second, we propose redundant sample downsampling to remove well-learned frames during training, reducing training time without compromising accuracy. Additionally, the fast training and confidence estimation capabilities of sample classification enable its integration into SLAM, effectively eliminating error accumulation. Extensive experiments on large-scale outdoor datasets demonstrate that LightLoc achieves state-of-the-art performance with a 50x reduction in training time than existing methods. Our code is available at https://github.com/liw95/LightLoc.

Related papers

• Don't Drop Dropout: Optimizing Layer Sparsity for Efficient LLM Training and Inference [15.267768829315408]
  Layer dropout has been shown to enable faster training and higher accuracy.<n> Layer dropout has largely disappeared from large language models pre-training recipes.<n>We show that layer dropout should be used in state-of-the-art LLM training.
  arXiv  Detail & Related papers  (2026-09-04T15:30:47Z)
• LightLoc++: Sensor-Robust Representation Learning for Efficient Outdoor LiDAR Localization [50.7242785475893]
  Scene coordinate regression (SCR) achieves strong performance in outdoor LiDAR localization, but it usually requires scene-specific training that can take days.<n>Recent works improve training efficiency by decoupling SCR into a scene-agnostic backbone and scene-specific prediction heads.<n>We propose LightLoc++, a sensor-robust and efficient outdoor LiDAR localization framework.
  arXiv  Detail & Related papers  (2026-08-15T16:50:34Z)
• Accelerated Online Reinforcement Learning using Auxiliary Start State Distributions [50.44719434877687]
  Expert demonstrations and simulators can reset to arbitrary states.<n>We find that using a notion of safety to inform the choice of this auxiliary distribution significantly accelerates learning.
  arXiv  Detail & Related papers  (2025-07-07T01:54:05Z)
• SparseLoRA: Accelerating LLM Fine-Tuning with Contextual Sparsity [52.88892280536302]
  We introduce SparseLoRA, a method that accelerates fine-tuning through contextual sparsity.<n>We show that SparseLoRA reduces computational cost by up to 2.2 times and a measured speedup of up to 1.6 times.
  arXiv  Detail & Related papers  (2025-06-19T17:53:34Z)
• SPAM: Spike-Aware Adam with Momentum Reset for Stable LLM Training [60.9776082805359]
  Large Language Models (LLMs) have demonstrated exceptional performance across diverse tasks, yet their training remains highly resource-intensive and susceptible to training instability. This paper presents a comprehensive investigation into gradient spikes observed during LLM training, revealing their prevalence across multiple architectures and datasets. We propose Spike-Aware Adam with Momentum Reset, a novel designed to counteract gradient spikes through momentum reset and spike-aware clipping.
  arXiv  Detail & Related papers  (2025-01-12T15:21:22Z)
• AutoScale: Scale-Aware Data Mixing for Pre-Training LLMs [61.13296177652599]
  We show that data mixtures that perform well at smaller scales may not retain their advantage at larger scales. We propose AutoScale, a two-stage, scale-aware data composition framework.
  arXiv  Detail & Related papers  (2024-07-29T17:06:30Z)
• Alpaca against Vicuna: Using LLMs to Uncover Memorization of LLMs [61.04246774006429]
  We introduce a black-box prompt optimization method that uses an attacker LLM agent to uncover higher levels of memorization in a victim agent.<n>We observe that our instruction-based prompts generate outputs with 23.7% higher overlap with training data compared to the baseline prefix-suffix measurements.<n>Our findings show that instruction-tuned models can expose pre-training data as much as their base-models, if not more so, and using instructions proposed by other LLMs can open a new avenue of automated attacks.
  arXiv  Detail & Related papers  (2024-03-05T19:32:01Z)
• Run LoRA Run: Faster and Lighter LoRA Implementations [50.347242693025336]
  LoRA is a technique that reduces the number of trainable parameters in a neural network by introducing low-rank adapters to linear layers. This paper presents the RunLoRA framework for efficient implementations of LoRA. Experiments show up to 28% speedup on language modeling networks.
  arXiv  Detail & Related papers  (2023-12-06T10:54:34Z)
• Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs [67.38165028487242]
  We introduce Dynamic Sparse No Training (DSnoT), a training-free fine-tuning approach to fine-tune large language models (LLMs) Inspired by the Dynamic Sparse Training, DSnoT minimizes the reconstruction error between the dense and sparse LLMs. Our paper offers fresh insights into how to fine-tune sparse LLMs in an efficient training-free manner and open new venues to scale the great potential of sparsity to LLMs.
  arXiv  Detail & Related papers  (2023-10-13T07:38:52Z)
• Train a Real-world Local Path Planner in One Hour via Partially Decoupled Reinforcement Learning and Vectorized Diversity [8.068886870457561]
  Deep Reinforcement Learning (DRL) has exhibited efficacy in resolving the Local Path Planning (LPP) problem.<n>Such application in the real world is immensely limited due to the deficient training efficiency and generalization capability of DRL.<n>A solution named Color is proposed, which consists of an Actor-Sharer-Learner (ASL) training framework and a mobile robot-oriented simulator Sparrow.
  arXiv  Detail & Related papers  (2023-05-07T03:39:31Z)
• Noise Self-Regression: A New Learning Paradigm to Enhance Low-Light Images Without Task-Related Data [86.68013790656762]
  We propose Noise SElf-Regression (NoiSER) without access to any task-related data.<n>NoiSER is highly competitive in enhancement quality, yet with a much smaller model size, and much lower training and inference cost.
  arXiv  Detail & Related papers  (2022-11-09T06:18:18Z)
• Flipped Classroom: Effective Teaching for Time Series Forecasting [0.0]
  Sequence-to-sequence models based on LSTM and GRU are a most popular choice for forecasting time series data. The two most common training strategies within this context are teacher forcing (TF) and free running (FR) We propose several new curricula, and systematically evaluate their performance in two experimental sets.
  arXiv  Detail & Related papers  (2022-10-17T11:53:25Z)
• Active Exploration for Neural Global Illumination of Variable Scenes [6.591705508311505]
  We introduce a novel Active Exploration method using Markov Chain Monte Carlo. We apply our approach on a neural generator that learns to render novel scene instances. Our method allows interactive rendering of hard light transport paths.
  arXiv  Detail & Related papers  (2022-03-15T21:45:51Z)
• Acceleration of Federated Learning with Alleviated Forgetting in Local Training [61.231021417674235]
  Federated learning (FL) enables distributed optimization of machine learning models while protecting privacy. We propose FedReg, an algorithm to accelerate FL with alleviated knowledge forgetting in the local training stage. Our experiments demonstrate that FedReg not only significantly improves the convergence rate of FL, especially when the neural network architecture is deep.
  arXiv  Detail & Related papers  (2022-03-05T02:31:32Z)
• AutoDrop: Training Deep Learning Models with Automatic Learning Rate Drop [16.396327849817464]
  We develop an algorithm that realizes the learning rate drop $textitautomatically$. We show that our method improves over SOTA training approaches.
  arXiv  Detail & Related papers  (2021-11-30T11:55:21Z)
• FROST: Faster and more Robust One-shot Semi-supervised Training [0.0]
  We present a one-shot semi-supervised learning method that trains up to an order of magnitude faster and is more robust than state-of-the-art methods. Our experiments demonstrate FROST's capability to perform well when the composition of the unlabeled data is unknown.
  arXiv  Detail & Related papers  (2020-11-18T18:56:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.