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

Trend · papers per month

4794141188 · May 202619922001200920172026
48 results for Sequential Projections

New insights into continual learning for deep models, showing convergence issues but local linear solutions.

problem Challenges in continual learning for homogeneous deep models.
method Sequential projections onto task margin sets, leveraging nonconvex projection theory.
result Local linear convergence under certain conditions for homogeneous deep networks.

A novel online GP model captures long-term memory in sequential data.

problem Capturing long-term memory in sequential data online.
method Integrates HiPPO framework into interdomain GP, leveraging time-varying orthogonal projections as inducing variables.
result OHSVGP outperforms existing online GP methods in predictive performance, long-term memory preservation, and computational efficiency.

We propose a method for non-projective dependency parsing by incrementally predicting a set of edges. Since the edges do not have a pre-specified order, we propose a set-based learning method. Our method blends graph, transition, and easy-first parsing, including a prior state of the parser as a special case. The propo…

2019-05-27abs ↗pdf ↗

Product models of low dimensional experts are a powerful way to avoid the curse of dimensionality. We present the ``under-complete product of experts' (UPoE), where each expert models a one dimensional projection of the data. The UPoE is fully tractable and may be interpreted as a parametric probabilistic model for pro…

2012-10-19abs ↗pdf ↗

PDTS improves robustness in sequential decision-making.

problem Robust active task sampling for efficient and reliable decision-making.
method Characterizes robust active task sampling as a Markov decision process, proposes PDTS method.
result Significantly improves zero-shot and few-shot adaptation robustness.

The abstract discusses financial irreversibility using quantum mechanics and projective geometry.

problem Financial irreversibility and its limitations in trading strategies.
method Projective geometry and Taylor expansion of directed distance in quantum systems.
result Fundamental asymmetry under state exchange is a key factor in financial irreversibility.

We present an information-theoretic framework for sequential adaptive compressed sensing, Info-Greedy Sensing, where measurements are chosen to maximize the extracted information conditioned on the previous measurements. We show that the widely used bisection approach is Info-Greedy for a family of kk-sparse signals b…

2014-07-02abs ↗pdf ↗

Dynamic treatment effects estimated over time using covariate balancing.

problem Estimating treatment effects in panel data with dynamic treatments.
method Dynamic covariate balancing with potential local projections.
result Established inferential guarantees for the proposed method.

Enhances multi-project scheduling with multiple priority rules.

problem Resource allocation in multi-project scheduling with limited time and resources.
method Simulation-based approach using composite priority rules.
result Increased probability of finding schedules with shortest duration.

Improves inference-time alignment for diffusion models without updating weights.

problem Aligning diffusion models without updating weights for high-reward outputs.
method Trust-Region Iterative Twisted Sequential Monte Carlo (TRI-TSMC) for variance reduction and efficiency.
result Improves primary alignment objectives on text generation tasks.

New method for sequential probability assignment reduces regret using contextual Shtarkov sums.

problem Minimizing regret in sequential probability assignment with arbitrary hypothesis classes.
method Introducing contextual Shtarkov sum and contextual Normalized Maximum Likelihood (cNML) algorithm.
result The contextual Shtarkov sum characterizes minimax regret and provides a minimax optimal strategy.

Imitation Learning is a sequential task where the learner tries to mimic an expert's action in order to achieve the best performance. Several algorithms have been proposed recently for this task. In this project, we aim at proposing a wide review of these algorithms, presenting their main features and comparing them on…

2018-01-19abs ↗pdf ↗

We study the impact of learning on the optimal policy and the time-to-decision in an infinite-horizon Bayesian sequential decision model with two irreversible alternatives, exit and expansion. In our model, a firm undertakes a small-scale pilot project so as to learn, via Bayesian updating, about the project\textquoter…

2019-01-14abs ↗pdf ↗

We study the value of information in sequential compressed sensing by characterizing the performance of sequential information guided sensing in practical scenarios when information is inaccurate. In particular, we assume the signal distribution is parameterized through Gaussian or Gaussian mixtures with estimated mean…

2015-09-01abs ↗pdf ↗

Seq2Tens uses tensors to efficiently represent sequences, improving performance on time series and video tasks.

problem Challenges in analyzing sequential data due to complex dependencies and non-commutativity.
method Uses tensor algebra to capture dependencies and low-rank tensor projections to manage computational complexity.
result State-of-the-art performance on multivariate time series classification and video generation benchmarks.

This paper simplifies OPE in large state spaces using state abstractions.

problem Accurately evaluating policies offline in large state spaces.
method Developed a backward-model-irrelevance condition and an iterative state abstraction procedure.
result Deeply-abstracted states substantially simplify OPE sample complexity.

The paper proposes a method to monitor deep learning predictions for retraining, reducing costs.

problem Reducing computational costs in deep learning by detecting when predictions are no longer valid.
method Sequential monitoring of network predictions based on projected second moments monitoring.
result The proposed method can drastically reduce computational costs in deep learning.

Algorithm identifies best arm in combinatorial bandits with semi-bandit feedback.

problem Identifying the best arm in combinatorial bandits with semi-bandit feedback.
method Interpreted as a sequential zero-sum game, developed a CombGame meta-algorithm with finite time guarantees.
result First computationally efficient algorithm that is asymptotically optimal and has competitive empirical performance.

We study sequential change-point detection procedures based on linear sketches of high-dimensional signal vectors using generalized likelihood ratio (GLR) statistics. The GLR statistics allow for an unknown post-change mean that represents an anomaly or novelty. We consider both fixed and time-varying projections, deri…

2015-05-25abs ↗pdf ↗

We study the behavior of the Kähler-Ricci flow on some Fano bundle which is a trivial bundle on one Zariski open set. We show that if the fiber is Pm\mathbb{P}^{m} blown up at one point or some weighted projective space blown up at the orbifold point and the initial metric is in a suitable kähler class, then the fibers…

2016-10-11abs ↗pdf ↗

Study optimizes zero-order strongly convex function minimization with higher order smoothness.

problem Optimizing a strongly convex function with noisy evaluations.
method Randomized approximation of projected gradient descent with smoothing kernel.
result Upper bounds and minimax lower bounds for the algorithm, showing near-optimality.

The problem of minimizing a continuously differentiable convex function over an intersection of closed convex sets is ubiquitous in applied mathematics. It is particularly interesting when it is easy to project onto each separate set, but nontrivial to project onto their intersection. Algorithms based on Newton's metho…

2012-11-16abs ↗pdf ↗

New method reduces memory usage for high-dimensional variable selection.

problem Scalability issues in high-dimensional variable selection, especially in genomics.
method Adaptive sampling of null features to eliminate dummy matrix materialization.
result Reduces memory and runtime by several orders of magnitude while preserving FDR control.

Generative adversarial nets (GANs) and variational auto-encoders have significantly improved our distribution modeling capabilities, showing promise for dataset augmentation, image-to-image translation and feature learning. However, to model high-dimensional distributions, sequential training and stacked architectures …

2019-04-11abs ↗pdf ↗

End-to-end autonomous driving perception learns latent features for better performance.

problem Current autonomous driving systems are complex and require human engineering.
method Sequential latent representation learning for end-to-end perception.
result End-to-end perception model solves detection, tracking, localization, and mapping problems.

New method uses diffusion models to generate proteins with specific motifs.

problem Generating proteins with specific functional substructures (motifs) using diffusion models.
method Adapting SMC-aided diffusion posterior samplers to zero-shot scaffolding tasks.
result Proposed potentials and samplers improve performance in generating proteins with desired motifs.

Study efficient sequential evaluation of large language models using historical data.

problem Sequentially evaluate a new large language model (LLM) on a fixed question set.
method Construct a confidence sequence (CS) and design active querying rules to shrink CS width.
result Simple uniform sampling can sometimes outperform adaptive querying rules.

Camera and lidar are important sensor modalities for robotics in general and self-driving cars in particular. The sensors provide complementary information offering an opportunity for tight sensor-fusion. Surprisingly, lidar-only methods outperform fusion methods on the main benchmark datasets, suggesting a gap in the …

2019-11-22abs ↗pdf ↗

Develops an online method for solving constrained optimization problems with debiasing techniques.

problem Online inference of solutions to constrained optimization problems with equality and inequality constraints.
method Stochastic Sequential Quadratic Programming (SSQP) with momentum debiasing.
result Achieves global almost-sure convergence and local asymptotic normality with optimal primal-dual limiting covariance.

A new framework predicts hidden Markov model regimes online.

problem Efficiently identify hidden Markov model regimes in streaming data.
method Develops a predictive-first optimisation framework for streaming HMMs, approximating the full posterior predictive distribution.
result The method provides competitive prequential performance compared to Online EM and Sequential Monte Carlo.

The paper investigates various generalizations of semisymmetric and pseudosymmetric manifolds.

problem Exploring different curvature tensor generalizations of semisymmetric and pseudosymmetric manifolds.
method Systematic review and examination of geometric structures with physical examples.
result Proper existence of various geometric structures, including Ricci pseudosymmetric manifolds.

Contextual bandits with linear payoffs, which are also known as linear bandits, provide a powerful alternative for solving practical problems of sequential decisions, e.g., online advertisements. In the era of big data, contextual data usually tend to be high-dimensional, which leads to new challenges for traditional l…

2019-03-20abs ↗pdf ↗

Neural networks are achieving state of the art and sometimes super-human performance on learning tasks across a variety of domains. Whenever these problems require learning in a continual or sequential manner, however, neural networks suffer from the problem of catastrophic forgetting; they forget how to solve previous…

2019-10-15abs ↗pdf ↗

New method uses few instruments to estimate complex causal effects.

problem Estimating causal effects with limited instruments in high-dimensional settings.
method Sequentially selects and combines instruments to estimate the treatment effect.
result Can reliably recover the treatment effect's projection onto the instrumented subspace.

In this note, we introduce a new type of warped products called as sequential warped products to cover a wider variety of exact solutions to Einstein's equation. First, we study the geometry of sequential warped products and obtain covariant derivatives, curvature tensor, Ricci curvature and scalar curvature formulas. …

2015-06-19abs ↗pdf ↗

Study finds conditions for certain warped product manifolds to be quasi-Einstein.

problem Conditions for quasi-Einstein sequential warped product manifolds.
method Investigated necessary and sufficient conditions for specific types of manifolds.
result Identified conditions for sequential warped product manifolds to be quasi-Einstein.