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,695 papers · 148 categories

Trend · papers per month

78155233310 · Jun 202019922001200920172026
48 results for Pilot Design

Paper proposes neural network for efficient MIMO channel estimation and pilot reduction.

problem High overhead from pilot transmission in wideband MIMO systems.
method Neural network architecture for frequency-aware pilot design and channel estimation, with pruning technique.
result Neural network outperforms linear minimum mean square error (LMMSE) estimation.

This paper develops novel deep learning-based architectures and design methodologies for an orthogonal frequency division multiplexing (OFDM) receiver under the constraint of one-bit complex quantization. Single bit quantization greatly reduces complexity and power consumption, but makes accurate channel estimation and…

2018-11-02abs ↗pdf ↗

CliMB-DC combines human guidance and data-centric tools to improve ML for non-technical experts.

problem Lack of data-centric handling in LLM co-pilots for non-technical users.
method Human-guided, data-centric framework combining advanced tools and LLM reasoning.
result Significantly outperforms existing co-pilot baselines for data-centric challenges.

Holographic Invariant Storage uses vector architectures to ensure LLM safety at design time.

problem Mitigating context drift in large language models (LLMs) during deployment.
method Introduces Holographic Invariant Storage (HIS) protocol that combines known properties of bipolar Vector Symbolic Architectures into a design-time safety contract.
result Closed-form guarantees for single-signal recovery fidelity, continuous-noise robustness, and multi-signal capacity degradation are provided and validated.

Study improves scalability of cell-free massive MIMO networks by optimizing UE-AP association.

problem Optimizing UE-AP association in cell-free massive MIMO networks.
method Deep learning algorithm using Bidirectional Long Short-Term Memory cells and hybrid probabilistic weight updating.
result Enhanced scalability without retraining, robust against pilot contamination.

This paper establishes non-asymptotic learning bounds for the DR covariate shift adaptation.

problem Distribution shift between training and test domains in machine learning.
method Doubly-robust (DR) estimator combining density ratio estimation and pilot regression model.
result First non-asymptotic learning bounds for DR covariate shift adaptation.

Develops a two-layer model to design mortgage assistance products.

problem Designing effective mortgage assistance products to improve household resilience.
method Two-layer approach: simulation and optimization.
result Shows how the approach can design and evaluate mortgage assistance products.

CogFormer trains a transformer to estimate parameters across various cognitive models.

problem Difficulty in fitting complex cognitive models and iterating over varying assumptions.
method Meta-amortized framework using a transformer to estimate parameters across multiple models.
result CogFormer accurately estimates parameters across different model families with minimal retraining.

EcoCast predicts biodiversity risks using satellite data and citizen science records.

problem Unprecedented shifts in species distributions due to climate change and habitat loss.
method Spatio-temporal model using sequence-based transformers and continual learning.
result Promising improvements in forecasting bird species distributions compared to Random Forest.

Bayesian optimization speeds up bioprocess development across scales.

problem Costly and complex bioprocess development across scales and biocatalyst selection.
method Multi-fidelity batch Bayesian optimization framework integrating Gaussian Processes and mixed-variable optimization.
result Reduction in experimental costs and increased yield in bioprocess optimization.

In this paper, we present a deep learning (DL) algorithm for channel estimation in communication systems. We consider the time-frequency response of a fast fading communication channel as a two-dimensional image. The aim is to find the unknown values of the channel response using some known values at the pilot location…

2018-10-13abs ↗pdf ↗

A new method learns the optimal pricing map for semiparametric dynamic pricing problems.

problem Optimizing pricing strategies in a semiparametric valuation model with unknown utility and noise.
method Developed a modular policy called ORBIT that uses a scalar pilot index, localizes a benchmark price, and learns a local polynomial approximation of the oracle price map.
result Achieves regret bound of \( \widetilde{O}\big(T^{\frac{2β-1}{4β-3}}+\sqrt{dT}\big) \) for the linear utility model and minimax sharp lower bound.

Skeinformer accelerates self-attention for long sequences with linear complexity.

problem Efficiency of Transformer models in processing long sequences.
method Matrix sketching and column sampling to reduce quadratic complexity to linear.
result Skeinformer outperforms alternatives with smaller time/space footprint.

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…

2019-05-14abs ↗pdf ↗

A new pricing controller handles resource constraints to infer target prices effectively.

problem Resource constraints prevent fixed-price inference, leading to support exclusion.
method Formalizes support-exclusion failure, designs a target-aware controller, and uses a realized information clock.
result The controller can certify feasible target bands and log continuous local densities, leading to polynomial rates of inference.

Study uses contextual bandits to optimize charity exposure in donation solicitation.

problem Optimizing charity exposure in donation solicitation using survey responses.
method Adaptive experiment design to balance cumulative regret minimization and simple regret minimization.
result Adaptive experimentation yields better policy learning outcomes than uniform randomization.

Novel methods improve Bayesian analysis of chaotic dynamical systems.

problem Bayesian parameter inference and trajectory reconstruction of chaotic systems with sparse and noisy data.
method Pilot MAGI (pMAGI) and Pilot MAGI Sequential Prediction (PMSP) methods.
result pMAGI and PMSP significantly outperform existing methods in accuracy and computational efficiency.

A new test improves statistical inference in bandit algorithms without sacrificing adaptiveness.

problem Challenges in statistical inference for adaptive randomised experiments in bandits.
method An allocation probability test for Thompson Sampling without trading-off regret or requiring large sample sizes.
result Improves statistical inference in small samples, showing advantages in mental health experiments.

Unified framework for efficient trans-dimensional Bayesian inference using VI and NFs.

problem Efficient trans-dimensional Bayesian inference with reduced computational cost.
method Variational inference with normalizing flows to train transport proposals.
result Our approach minimizes reverse KL divergence and reduces computational cost.

In recent years, the interest in Big Data sources has been steadily growing within the Official Statistic community. The Italian National Institute of Statistics (Istat) is currently carrying out several Big Data pilot studies. One of these studies, the ICT Big Data pilot, aims at exploiting massive amounts of textual …

2019-10-22abs ↗pdf ↗

A learning algorithm optimizes beamforming for holographic transceivers in far-field communication.

problem Optimal phase-shifts for beamforming in holographic transceivers are challenging due to unknown receiver locations and large phase-shifts.
method Developed a learning algorithm using a fixed-budget multi-armed bandit framework to learn optimal phase-shifts.
result The algorithm, HoloBeam, outperforms state-of-the-art methods in beamforming optimization.

Proposes a new semi-parametric framework for batched bandits with covariates.

problem Sequential decision-making with batched feedback and contextual information.
method Batched single-Index Dynamic binning and Successive arm elimination (BIDS) using single-index regression.
result Achieves minimax-optimal rates for nonparametric batched bandits.

In machine learning, the choice of a learning algorithm that is suitable for the application domain is critical. The performance metric used to compare different algorithms must also reflect the concerns of users in the application domain under consideration. In this work, we propose a novel probability-based performan…

2013-03-28abs ↗pdf ↗

A predictor that is deployed in a live production system may perturb the features it uses to make predictions. Such a feedback loop can occur, for example, when a model that predicts a certain type of behavior ends up causing the behavior it predicts, thus creating a self-fulfilling prophecy. In this paper we analyze p…

2013-10-10abs ↗pdf ↗