New algorithms learn online without prior data info.
problem Lack of prior data info hinders optimization algorithms.
method Developed new lower bounds and constructed algorithms.
result Achieved optimal performance on data without prior info.
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.
169,291 papers · 148 categories
Trend · papers per month
48 results for “prior info”
Study achieves fairness without demographic info, improving regression tasks.
problem Achieve fairness in models without prior demographic info.
method VFair method to minimize training loss variance, dynamic update approach.
result Regression tasks can achieve significant fairness improvement without prior demographics.
Proposes online compressive robust PCA with prior info.
problem Online video foreground-background separation from sparse and low-rank components.
method Combines prior info and compressive sensing for recursive separation.
result Improves separation using multiple prior info and theoretical bounds.
Info Interventioncs.AI
Introduces info intervention to handle causal questions and check counterfactual variables.
problem Controversial interpretation of causal questions for non-manipulable variables and lack of power to check counterfactual variables.
method Intervenes input/output information of causal mechanisms, providing causal diagrams for communication and theoretical focus.
result Causal diagrams based on info intervention provide a new perspective on information transfer as causality.
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 -sparse signals b…
Improved semantic segmentation accuracy by addressing class imbalance.
problem Class imbalance in training data leads to misclassification of rare classes.
method Localized weighting of posterior class probabilities with pixel-wise priors.
result Significant improvement in recall and reduction of non-detection rate for rare classes.
Prior-Dependent Allocations for Bayesian Fixed-Budget Best-Arm Identification in Structured Banditsstat.ML
Algorithm identifies best arm with prior info in structured bandits.
problem Bayesian fixed-budget best-arm identification in structured bandits.
method Prior-dependent allocations based on structure and prior information.
result Improved theoretical bounds and robust performance across diverse models.
Paper learns robot's end-effector position without prior info.
problem Lack of prior robot structure or sensor info.
method Generates internal end-effector config from raw data.
result Can control robot without prior kinematic info.
Optimal algorithm selects biological models without prior info.
problem Determining the correct biological model without prior knowledge.
method Systems biology models and likelihood-free inference.
result Improved model selection performance over conventional methods.
Deep RL model learns 2.5D fighting games with height ambiguity.
problem Ambiguity in character height/depth and sequential action orders in 2.5D fighting games.
method Modified A3C network with Recurrent Info network for combo skill observation.
result Successfully learned and played Little Fighter 2 (LF2) 2.5D fighting game.
Optimistic algorithms and Thompson sampling use info-theory for better reinforcement learning.
problem Designing algorithms that balance exploration and exploitation in reinforcement learning.
method Integrating information-theoretic concepts into optimistic algorithms and Thompson sampling.
result Cumulative regret bound depends on uncertainty and quantifies prior information value.
New FGSPCA method captures grouping and sparse structures in PCA without prior info.
problem Capture grouping and sparse structures in PCA without prior info.
method Truncated regularization with alternating algorithm.
result FGSPCA method reduces model complexity and increases interpretability.
HGKT transfers knowledge from seen to unseen classes in GZSL without prior unseen class info.
problem Learning to classify unseen classes in GZSL.
method Structured heterogeneous graph with graph neural network for knowledge transfer.
result Achieves state-of-the-art results on public benchmark datasets.
We characterize the performance of sequential information guided sensing, Info-Greedy Sensing, when there is a mismatch between the true signal model and the assumed model, which may be a sample estimate. In particular, we consider a setup where the signal is low-rank Gaussian and the measurements are taken in the dire…
New bounds for heavy-tailed SDEs without info-theory terms.
problem Understanding generalization of heavy-tailed stochastic optimization.
method Fractional Fokker-Planck equation to estimate entropy flows.
result High-probability bounds with better dimension dependence.
Paper accelerates L-BFGS with second-order info and stochastic batches.
problem Optimizing finite-sum minimization problems.
method Proposes L-BFGS with smooth gradient difference estimates and well-scaling initial Hessians.
result Achieves acceleration in both convex and nonconvex cases.
Maximizes mutual info across views for better image representations.
problem Improving image representation learning through multiple views.
method Maximizing mutual information between features from multiple views.
result ImageNet accuracy of 68.1% using linear evaluation, significantly outperforming prior methods.
Study multiplayer bandits without collision info, achieving regret bounds.
problem Multiplayer bandits without collision info.
method Two feedback models considered; algorithms for both models.
result First theoretical guarantees for second model with square-root regret.
Proper balance between exploitation and exploration is what makes good decisions, which achieve high rewards like payoff or evolutionary fitness. The Infomax principle postulates that maximization of information directs the function of diverse systems, from living systems to artificial neural networks. While specific a…
Study portfolio optimization with partial info and drawdown constraints using deep learning.
problem Optimizing portfolios with partial information and maximum drawdown constraints.
method Bayesian framework, dynamic programming, semi-explicit solutions, deep learning for stochastic control.
result Numerical solutions and performance analysis with deep learning, convergence to Merton problem.
Nash integrates covariate-specific side info into sparse regression via neural networks.
problem Sparse linear regression struggles with covariates exhibiting structure or coming from heterogeneous sources.
method Neural Adaptive Shrinkage (Nash) framework that integrates side information into sparse regression via neural networks. Uses split variational empirical Bayes algorithm.
result Nash improves accuracy and adaptability over existing methods in real data experiments.
Rating Prediction is a basic problem in Recommender System, and one of the most widely used method is Factorization Machines(FM). However, traditional matrix factorization methods fail to utilize the benefit of implicit feedback, which has been proved to be important in Rating Prediction problem. In this work, we consi…
Estimates non-parametric logistic model using case-control data and external summary info.
problem Imbalanced binary data in case-control studies.
method Two-step estimation procedure with deep neural network for functional approximation.
result Proposed estimator achieves optimal convergence rate in non-parametric regression.
VTrackIt creates a synthetic dataset with infrastructure and vehicle info for AVs.
problem Lack of infrastructure and pooled vehicle info in existing AV datasets.
method Developed VTrackIt, a synthetic dataset with intelligent infrastructure and pooled vehicle info, and introduced InfraGAN for trajectory predictions.
result VTrackIt reduces high-risk edge cases in AV trajectory predictions.
TaRP predicts missing relations in KGs using type and instance-level info.
problem Missing relations in KGs.
method Type-augmented relation prediction (TaRP) combining type and instance-level info.
result Significantly better performance on benchmark datasets.
Enhancing Network Embedding with Auxiliary Information: An Explicit Matrix Factorization Perspectivecs.SI
Enhances network embedding with auxiliary info using matrix factorization.
problem Lack of flexible incorporation of auxiliary info (content and labels) in network embedding.
method Explicit matrix factorization incorporating structure, content, and label info.
result Unified framework for learning network embedding with structure, content, and label info.
ViterbiNet uses deep learning to detect symbols without channel info.
problem Symbol detection in digital receivers without channel state info.
method Integrates DNNs into Viterbi algorithm, leaving structure intact.
result Performance of ViterbiNet approaches CSI-based Viterbi, tracks dynamic channels.
β-VAEs retain label info even at high compression.
problem Retaining label information in compressed representations.
method Investigation of -VAE architectures on Binary Static MNIST and Omniglot.
result β-VAEs can retain label information even at high compression.
MFAI uses gradient boosted trees to leverage auxiliary info for scalable Bayesian matrix factorization.
problem Matrix factorization struggles with poor data quality, especially high sparsity and low SNR.
method Integrates gradient boosted trees into probabilistic matrix factorization framework.
result MFAI effectively leverages auxiliary information, improving model performance.
Paper tackles circularity issues in machine learning predictions.
problem Circularity problems in machine learning predictions.
method Not specified in the abstract.
result Not specified in the abstract.
Bayesian optimization with binary auxiliary info for faster target function optimization.
problem Optimizing target functions with expensive binary auxiliary information.
method Mixed-type Gaussian process (MOGP) and information-based acquisition functions (MT-ES, MT-PES).
result Efficient approximation of mixed-type predictive ES via random features.
Combines geometric and topological info for complex object boundaries.
problem Boundary estimation for images with complex topologies.
method Topological clustering for initialization of Bayesian active contour model.
result Smart initialization reduces user dependence and improves accuracy.
Paper tackles multi-objective contextual bandit with similarity info.
problem Extending classical contextual bandit with multiple conflicting objectives.
method Developed PCZ algorithm that learns arms close to Pareto front.
result Proved nearly optimal regret bound for PCZ algorithm.
New method controls linear systems with partial info and disturbances.
problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.
New method uses mutual info and network science to explain deep learning models.
problem Interpreting deep neural networks for understanding their decision-making process.
method Coupling mutual information with network science to quantify information flow in deep learning models.
result Proposed NIF technique for codifying information flow in deep learning models.
AMM models complex data with minimal labeled info.
problem Clustering complex data with little labeled info.
method Adversarial optimization of mixture models.
result Achieves 2.86% unsupervised clustering error on MNIST.
Study mutual info for community detection with covariate and correlated networks.
problem Community detection with covariate and correlated networks.
method Asymptotic upper bound and MMSE matrix heuristic analysis.
result Explicit characterization of combined information effects.
MO-GP models fill gaps in biophysical data with across-domain info transfer.
problem Gap filling of biophysical parameters LAI and fAPAR over rice areas.
method Multi-output Gaussian Processes (MO-GP) based on Linear Model of Coregionalization (LMC).
result MO-GP models successfully predict biophysical variables even in high missing data regimes.
System separates sounds from mixtures without ground truth info.
problem Sound separation from multi-channel mixtures without labeled data.
method Deep clustering on multi-channel mixtures, projecting bins to spatially correlated clusters.
result Performance matches ground truth separation using only multi-channel mixtures.
PHI Scrubber removes sensitive patient info from medical notes.
problem Protecting patient privacy in electronic health records.
method Deep learning model with de-convolutional neural network and bi-directional LSTM-CNN.
result Eliminates individually identifiable information from physician notes.
Improved GANs model geological facies with diversity and unbiased distribution.
problem Generating unbiased and representative geological models from training images.
method Info-WGAN combining InfoGAN, Wasserstein distance, and Gradient Penalty.
result Generated samples have equal probability distribution as training data.
Capsule Networks improve clothing retrieval without landmark info.
problem In-shop clothing retrieval performance improvement.
method Triplet-based Capsule Network architecture with SC and RC blocks.
result Triplet Capsule Networks outperform FashionNet and SOTA architectures.
New matrix reveals cluster info in sparse directed graphs.
problem Analyzing cluster information in directed graphs.
method Proposed complex non-backtracking matrix integrating Hermitian adjacency matrix and non-backtracking matrix properties.
result The complex non-backtracking matrix holds cluster information, especially for sparse directed graphs.
TOGL adds topological info to GNNs, improving graph and node classification.
problem Graph neural networks lack substructure awareness, especially cycles.
method Integrates global topological information using persistent homology.
result Improves predictive performance for graph and node classification.
Nucleosome positioning is an important process required for proper genome packing and its accessibility to execute the genetic program in a cell-specific, timely manner. In the recent years hundreds of papers have been devoted to the bioinformatics, physics and biology of nucleosome positioning. The purpose of this rev…
Trading floors need to be twice as deep as electronic markets to compete.
problem Informed traders prefer fast electronic markets over slow trading floors.
method Examined the performance of trading floors and electronic markets in a hybrid system.
result Trading floors need to be twice as deep as electronic markets to compete.
Paper proposes method to recover quantized data with missing info.
problem Recovering quantized data with missing information.
method Regularized convex cost function with Bi-factorization and Augmented Lagrangian Method.
result The method finds global minimizer of the cost function.
RPO uses past and future state-action info for better policy optimization.
problem Sample inefficiency in on-policy reinforcement learning methods.
method Reflective Policy Optimization (RPO) integrates past and future state-action info for policy improvement.
result RPO improves policy performance and contracts the solution space, leading to faster convergence.