The problem of feedback equivalence for control systems is considered. An algebra of differential invariants and criteria for the feedback equivalence for regular control systems are found.
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,742 papers · 148 categories
Trend · papers per month
48 results for “feedback equivalence”
The problem of local feedback equivalence for 1-dimensional control systems of the 1-st order is considered. The algebra of differential invariants and criteria for the feedback equivalence for regular control systems are found.
Study absolute equivalence for Pfaffian systems, applying to control systems.
problem Absolute equivalence of Pfaffian systems with specific independence conditions.
method Structural results for Pfaffian systems of corank 3, applied to control systems.
result Dynamic feedback linearization of control systems with 2 inputs.
Paper presents a new flat triangular form for systems.
problem Creating a structurally flat triangular form for systems.
method Developed a new triangular form based on the extended chained form with conditions for static feedback equivalence.
result Provided conditions for affine input systems to be static feedback equivalent to the new triangular form.
Paper presents a new triangular form for flat systems.
problem Designing flat systems with two inputs.
method Geometric characterization and static feedback equivalence.
result Sufficient condition for affine input systems to be flat.
Advocates a local feedback approach for RL in unknown systems.
problem Finding optimal feedback laws in unknown nonlinear dynamical systems.
method Searches over a local feedback representation consisting of an open-loop sequence and an optimal linear feedback law.
result Results in highly efficient training and superior performance compared to global methods.
Research characterizes learnability of multilabel ranking problems.
problem Learnability of multilabel ranking problems with relevance-score feedback.
method Characterizes learnability in batch and online settings for a large family of ranking losses.
result Characterizes two equivalence classes of ranking losses based on learnability.
Paper classifies conic submanifolds in control systems.
problem Characterizing and classifying conic submanifolds in control systems.
method Feedback equivalence of control-affine and fully nonlinear systems.
result Complete description of non-degenerate conic submanifolds.
The abstract explores connections between reinforcement learning, scaling, and diffusion.
problem Aligning reinforcement learning with human feedback and scaling techniques.
method Clarifying connections between reinforcement learning, scaling, and diffusion.
result Introducing a resampling approach for alignment and reward-directed diffusion models.
The paper provides guarantees for feedback control with sensor errors.
problem Certifying performance and safety in feedback control systems with sensor errors.
method Solving a supervised learning problem to characterize sensor errors and providing uniform error bounds.
result Finite-time convergence rate on sub-optimality of using a regressor in closed-loop for waypoint tracking.
A control system is said to be trivializable if there exists local coordinates in which the system is feedback equivalent to a control system of the form . In this paper we characterize trivializable control systems and control systems for which, up to a feedback transformation, a…
New graph types help identify complex relationships.
problem Understanding complex relationships in data.
method Introducing separable and essentially separable graphs to characterize and identify graphical models.
result Developed algorithms to identify equivalence classes of essentially separable graphs.
Study online learning with set-valued feedback, showing differences between deterministic and randomized approaches.
problem Online learning with set-valued feedback, where labels are sets rather than single labels.
method Introduced new combinatorial dimensions (Set Littlestone and Measure Shattering) to characterize learnability.
result Characterized deterministic and randomized online learnability, and established bounds for various learning settings.
CausalRM models rewards from user feedback, overcoming noise and bias.
problem Aligning language models with user preferences from noisy, biased feedback.
method Causal-theoretic reward modeling framework addressing noise and bias in observational feedback.
result CausalRM learns accurate reward signals from noisy and biased observational feedback.
Algorithm minimizes regret in predictive models influenced by their own predictions.
problem Finding near-optimal models under performativity with unknown shifts.
method Developed an algorithm that uses performative feedback to achieve low regret, scaling only with distribution shift complexity.
result Achieved regret bounds scaling with distribution shift complexity, not reward function complexity.
Improved online learning for hidden-convex losses achieves optimal regret.
problem Adversarial online learning with nonconvex losses that become convex after reparameterization.
method Algorithmic equivalence between OGD and OMD on convex losses, with Hessian compatibility condition.
result OGD achieves regret for hidden-convex losses, matching optimal rate.
Feedback improves ESN performance by 30-60% across various tasks.
problem Reducing computational complexity in ESNs for complex sequential data processing.
method State feedback to modify the internal reservoir state of ESNs.
result Feedback significantly improves ESN performance, reducing error by 30-60%.
Many real-world engineering problems rely on human preferences to guide their design and optimization. We present PrefOpt, an open source package to simplify sequential optimization tasks that incorporate human preference feedback. Our approach extends an existing latent variable model for binary preferences to allow f…
Paper analyzes online reinforcement learning with outcome-based feedback, providing efficient algorithms and fundamental limits.
problem Assigning credit to actions in reinforcement learning with only endpoint rewards.
method Develops a provably sample-efficient algorithm for online reinforcement learning with general function approximation.
result Achieves sample complexity, characterizing statistical separation between outcome-based and per-step rewards.
Study the tradeoffs of bandit feedback in multiclass classification.
problem The price of using bandit feedback in multiclass classification.
method Mistake bound model, analysis of variants, and comparison of learners and adversaries.
result The optimal mistake bound under bandit feedback is at most times higher than in full information, with a tight bound of .
A new method for RLHF using proximal point Nash learning.
problem Capturing real human preferences in RLHF.
method Proximal point Nash learning, embedding self-play updates into a proximal point framework.
result High-probability last-iterate convergence for the combined method.
Study online control of unknown time-varying systems with negative and positive results.
problem Online control of time-varying systems with unknown dynamics.
method Algorithmic upper bounds and lower bounds for different policy classes.
result Sublinear adaptive regret bounds for Disturbance Response policies.
Work shows hallucination detection by LLMs is impossible without expert feedback.
problem Detecting hallucinations in LLMs is theoretically impossible without expert-labeled feedback.
method Investigated hallucination detection using a theoretical framework inspired by language identification.
result Automated hallucination detection is impossible for most language collections without expert-labeled feedback.
SAIL improves online alignment of large language models with minimal feedback.
problem Offline RLHF methods often lead to sub-optimal performance due to fixed preference datasets.
method SAIL uses bilevel optimization and a single-level first-order method to iteratively refine model alignment.
result SAIL significantly improves alignment performance on open-sourced datasets with minimal computational overhead.
Improved error feedback method reduces communication complexity in distributed training.
problem Improving convergence in distributed training methods with compression techniques.
method Introduced and improved a modern form of error feedback (EF21) by reducing its theoretical communication complexity.
result Communication complexity depends on the arithmetic mean of smoothness parameters, leading to significant improvements.
The paper is devoted to the local classification of generic control-affine systems on an n-dimensional manifold with scalar input for any n>3 or with two inputs for n=4 and n=5, up to state-feedback transformations, preserving the affine structure. First using the Poincare series of moduli numbers we introduce the intr…
New insights into cascade feedback linearization of control systems.
problem Obtaining a cascade feedback linearization for invariant control systems.
method Introducing truncated versions of operators from the calculus of variations to prove new theorems.
result Established new geometry and foundational theorems for future work.
New method learns from either positive or negative feedback alone.
problem Limited applicability of existing preference optimization methods in scenarios with only unpaired feedback.
method Decouples learning from positive and negative feedback, using expectation-maximization (EM) to optimize probability of positive outcomes and explicitly incorporate negative examples.
result Stable learning from negative feedback alone demonstrated.
A new method reduces the computational burden of safety alignment for large language models.
problem Safety concerns in large language models and the need to align them with human preferences.
method Optimal dualization approach to reduce constrained alignment to an unconstrained problem.
result Our algorithms MoCAN and PeCAN significantly reduce computational burden and improve training stability.
Study resource allocation strategies in sequential decisions with unknown rewards.
problem Sequential resource allocation with unknown rewards.
method Design combinatorial multi-armed bandit algorithms for discrete or continuous budgets.
result Prove algorithms achieve logarithmic cumulative regret under semi-bandit feedback.
User preferences for items can be inferred from either explicit feedback, such as item ratings, or implicit feedback, such as rental histories. Research in collaborative filtering has concentrated on explicit feedback, resulting in the development of accurate and scalable models. However, since explicit feedback is oft…
This paper improves image retrieval accuracy through novel relevance feedback methods.
problem Improving image retrieval accuracy in Content-Based Image Retrieval (CBIR).
method Novel addition to feature re-weighting and classification techniques, focusing on 0-th iteration improvement.
result Significantly improved retrieval accuracy from relevance feedback.
Explicit Feedbacks Meet with Implicit Feedbacks : A Combined Approach for Recommendation Systemcs.IR
Recommender systems recommend items more accurately by analyzing users' potential interest on different brands' items. In conjunction with users' rating similarity, the presence of users' implicit feedbacks like clicking items, viewing items specifications, watching videos etc. have been proved to be helpful for learni…
Study evaluates new models using human feedback from another model.
problem Evaluate a new model using human feedback collected for another model.
method Formalize problem, propose model-based and model-free estimators, analyze unbiasedness, and empirically evaluate.
result Proposed estimators can predict absolute values, rank, and optimize evaluated policies.
Develops a new model for RLHF accounting for partially observed states and intermediate feedback.
problem Lack of models for partially observed states and intermediate feedback in RLHF.
method PORRL model with cardinal and dueling feedback methods.
result Demonstrates improved learning and alignment with new model-based and model-free methods.
Classifier learns to ignore unreliable feedback from end users.
problem Improving classifier performance by filtering unreliable feedback.
method Modeling end users as autonomous agents, periodically retraining classifier with filtered feedback.
result Classifier can identify and filter out unreliable feedback, improving performance.
Pricing options in illiquid markets: optimal systems, symmetry reductions and exact solutionsq-fin.PR
We study a class of nonlinear pricing models which involves the feedback effect from the dynamic hedging strategies on the price of asset introduced by Sircar and Papanicolaou. We are first to study the case of a nonlinear demand function involved in the model. Using a Lie group analysis we investigate the symmetry pro…
Paper characterizes minimax regret rates for online ranking with top-k feedback.
problem Analyzing online ranking with partial feedback.
method Developed techniques from partial monitoring to characterize minimax regret rates.
result Full characterization of minimax regret rates for Precision@n.
Study on sample complexity for pure exploration in feedback graph settings.
problem Sample complexity of pure exploration in online learning with feedback graphs.
method Derive instance-specific lower bounds and present asymptotically optimal algorithm TaS-FG.
result TaS-FG is asymptotically optimal and efficient across different graph configurations.
One-bit feedback suffices for a bandit problem's optimal strategy.
problem Optimal strategy for multi-armed bandit problem with limited feedback.
method Coding and decoding schemes for one-bit feedback to mimic full-reward feedback.
result Regret ratio approaches 1 with one-bit feedback.
A method corrects feedback shift in predicting conversion rates with delayed feedback.
problem Delayed feedback leads to mislabeling of positive instances in training data.
method Uses importance weight approach to correct feedback shift.
result Proposed method outperforms existing methods in offline and online experiments.
Study how communication and feedback graphs affect learning outcomes.
problem Understanding the impact of feedback graphs on cooperative online learning.
method Analyzed network regret in terms of the independence number of the strong product of communication and feedback graphs.
result Proved bounds for network regret and demonstrated the non-improvable nature of positive results in pathological cases.
Enhanced word embedding creates new consumer-friendly health terms.
problem Laymen's health terms are often jargon and hard to understand.
method Developed an enhanced GloVe word embedding technique to generate new consumer-friendly terms.
result New CHV terms generated from consumer-generated text.
New method uses correlated auxiliary feedback to reduce regret in parameterized bandits.
problem Reducing regret in parameterized bandits with correlated auxiliary feedback.
method Develops a reward estimator using auxiliary feedback with tight confidence bounds.
result Shows significant reduction in regret compared to standard methods.
Test for linearizing 2-input systems with 2D feedback.
problem Linearizability of two-input systems by feedback.
method Algorithmic test for 2D endogenous feedback.
result Systematic derivation of flat outputs.
Paper shows equivalence between two alignment methods and introduces a new algorithm.
problem Ensuring human alignment of large language models for useful, safe, and pleasant user experience.
method Introduces IPO-MD algorithm, showing equivalence between IPO and Nash-MD methods.
result Equivalence between IPO and Nash-MD methods proven when considering online version of IPO.
This paper analyzes optimal consumption strategies for loss-averse investors with multiplicative habit formation.
problem Optimal consumption strategies for loss-averse investors with multiplicative habit formation.
method The study uses a concave envelope of the S-shaped utility function and a nonlinear free boundary problem to analyze the HJB equation.
result The paper provides optimal consumption and investment policies in feedback form.
Reduces user feedback needed for accurate recommender systems.
problem Limited user feedback in recommender systems.
method Partial Bandit and Semi-Bandit approach for efficient user feedback retrieval.
result Similar global accuracy and learning efficiency with reduced feedback.