András György

发表

(Bandit) Convex Optimization with Biased Noisy Gradient Oracles pdf

Xiaowei Hu, A. PrashanthL., András György, 2015, AISTATS.

Efficient Multi-Start Strategies for Local Search Algorithms

András György, Levente Kocsis, A. György, 2009, J. Artif. Intell. Res..

Estimates on the packet loss ratio via queue tail probabilities

András György, Tamás Borsos, A. György, 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

Exploiting Symmetries to Construct Efficient MCMC Algorithms With an Application to SLAM

András György, Csaba Szepesvári, Roshan Shariff, 2015, AISTATS.

Improved policy representation and policy search for proactive content caching in wireless networks

Deniz Gündüz, András György, Samuel O. Somuyiwa, 2017, 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

Online Learning with Costly Features and Labels

Russell Greiner, András György, Csaba Szepesvári, 2013, NIPS.

Adaptive Routing Using Expert Advice

András György, György Ottucsák, A. György, 2006, Comput. J..

Near-optimal max-affine estimators for convex regression

András György, Csaba Szepesvári, Gábor Balázs, 2015, AISTATS.

Erratum to: Scalable metric learning for co-embedding

Martha White, Dale Schuurmans, András György, 2015 .

Az internet jövője

András György, Péter Bakonyi, Beatrix Tóth, 2008 .

On the structure of optimal entropy-constrained scalar quantizers

Tamás Linder, András György, A. György, 2002, IEEE Trans. Inf. Theory.

Tracking the Best Quantizer

Tamás Linder, András György, Gábor Lugosi, 2005, IEEE Transactions on Information Theory.

Adaptive MCMC via Combining Local Samplers

András György, Kiarash Shaloudegi, 2019, AISTATS.

BoostingTree: parallel selection of weak learners in boosting, with application to ranking

András György, Levente Kocsis, Andrea N. Bán, 2013, Machine Learning.

Improved convergence rates in empirical vector quantizer design

László Györfi, András György, András Antos, 2004, ISIT.

Delay-Tolerant Online Convex Optimization: Unified Analysis and Adaptive-Gradient Algorithms

András György, Csaba Szepesvári, Pooria Joulani, 2016, AAAI.

Tracking the best quantizer

Tamás Linder, András György, Gábor Lugosi, 2005, ISIT.

Efficient Tracking of Large Classes of Experts

Tamás Linder, András György, Gábor Lugosi, 2011, IEEE Transactions on Information Theory.

Shifting Regret, Mirror Descent, and Matrices

András György, Csaba Szepesvári, Csaba Szepesvari, 2016, ICML.

Do optimal entropy-constrained quantizers have a finite or infinite number of codewords?

Tamás Linder, András György, Philip A. Chou, 2003, IEEE Trans. Inf. Theory.

Efficient adaptive algorithms and minimax bounds for zero-delay lossy source coding

Tamás Linder, András György, Gábor Lugosi, 2004, IEEE Transactions on Signal Processing.

A Randomized Mirror Descent Algorithm for Large Scale Multiple Kernel Learning

Michael H. Bowling, András György, Csaba Szepesvári, 2012, ICML.

Optimal Experiment Design and Leveraging Competition for Shared Resources in Cell-Free Extracts

Richard M. Murray, Wolfgang Halter, Frank Allgöwer, 2018, 2018 IEEE Conference on Decision and Control (CDC).

Information Theory: Multiple-access channels

Imre Csiszár, András György, A. György, 2007 .

How slaves affect a master module in gene transcription networks

Domitilla Del Vecchio, András György, A. György, 2013, 52nd IEEE Conference on Decision and Control.

Retroactivity to the input in complex gene transcription networks

Domitilla Del Vecchio, András György, A. György, 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

Reinforcement Learning for Proactive Caching of Contents with Different Demand Probabilities

Deniz Gündüz, András György, Samuel O. Somuyiwa, 2018, 2018 15th International Symposium on Wireless Communication Systems (ISWCS).

Meta-learning of Sequential Strategies pdf

Yee Whye Teh, Razvan Pascanu, Nando de Freitas, 2019, ArXiv.

Codecell convexity in optimal entropy-constrained vector quantization

Tamás Linder, András György, A. György, 2003, IEEE Transactions on Information Theory.

Type 1 Diabetes Regulated by ANFIS at Molecular Levels

Levente Kovács, András György, Balázs Benyó, 2009 .

A Markov-Chain Monte Carlo Approach to Simultaneous Localization and Mapping

András György, Csaba Szepesvári, Péter Torma, 2010, AISTATS.

Tracking the Best of Many Experts

Tamás Linder, András György, Gábor Lugosi, 2005, COLT.

Quasi-Model-Based Control of Type 1 Diabetes Mellitus

Levente Kovács, András György, Balázs Benyó, 2011, J. Electr. Comput. Eng..

Robust servo control of a novel type 1 diabetic model

Levente Kovács, András György, Balázs Kulcsár, 2011 .

Fast Cross-Validation for Incremental Learning pdf

András György, Csaba Szepesvári, Pooria Joulani, 2015, IJCAI.

The Shortest Path Problem in the Bandit Setting

Tamás Linder, András György, Gábor Lugosi, 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.

Efficient Multi-start Strategies for Local Search Algorithms

András György, Levente Kocsis, 2009, ECML/PKDD.

Functional modularity in gene networks

András György, 2016 .

Efficient Tracking of Large Classes of Experts

Tamás Linder, András György, Gábor Lugosi, 2012, IEEE Trans. Inf. Theory.

Efficient tracking of the best of many experts

András György, Gábor Lugosi, Tamas Linder, 2008 .

CapsAndRuns: An Improved Method for Approximately Optimal Algorithm Configuration

András György, Csaba Szepesvári, Gellért Weisz, 2019, ICML.

Individual convergence rates in empirical vector quantizer design

László Györfi, András György, András Antos, 2005, IEEE Transactions on Information Theory.

Minimal Assumptions Refinement for Realizable Specifications

Dalal Alrajeh, András György, Davide G. Cavezza, 2020, 2020 IEEE/ACM 8th International Conference on Formal Methods in Software Engineering (FormaliSE).

Learning from Delayed Outcomes via Proxies with Applications to Recommender Systems

András György, Timothy A. Mann, Sven Gowal, 2018, ICML.

Energy-efficient wireless content delivery with proactive caching

Deniz Gündüz, András György, Samuel O. Somuyiwa, 2017, 2017 15th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt).

Limitations and trade-offs in gene expression due to competition for shared cellular resources

Domitilla Del Vecchio, András György, A. György, 2014, CDC.

Detection of Adversarial Training Examples in Poisoning Attacks through Anomaly Detection pdf

Luis Muñoz-González, Emil C. Lupu, András György, 2018, ArXiv.

Quantifying resource competition and its effects in the TX-TL system

Richard M. Murray, András György, A. György, 2016, 2016 IEEE 55th Conference on Decision and Control (CDC).

Fraud Detection by Generating Positive Samples for Classification from Unlabeled Data

András György, Levente Kocsis, A. György, 2010 .

A Reinforcement-Learning Approach to Proactive Caching in Wireless Networks

Deniz Gündüz, András György, Samuel O. Somuyiwa, 2017, IEEE Journal on Selected Areas in Communications.

Detecting Overfitting via Adversarial Examples

András György, Csaba Szepesvári, Roman Werpachowski, 2019, NeurIPS.

SDP Relaxation with Randomized Rounding for Energy Disaggregation pdf

Wilsun Xu, András György, Csaba Szepesvári, 2016, NIPS.

Reinforcement Learning to Minimize Age of Information with an Energy Harvesting Sensor with HARQ and Sensing Cost

Deniz Gündüz, András György, Elif Tugçe Ceran, 2019, IEEE INFOCOM 2019 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS).

Following the Leader and Fast Rates in Linear Prediction: Curved Constraint Sets and Other Regularities

Tor Lattimore, András György, Csaba Szepesvári, 2016, NIPS.

On Identifying Good Options under Combinatorially Structured Feedback in Finite Noisy Environments

Yifan Wu, András György, Csaba Szepesvári, 2015, ICML.

Partition Tree Weighting

Martha White, Joel Veness, Michael H. Bowling, 2012, 2013 Data Compression Conference.

LEAPSANDBOUNDS: A Method for Approximately Optimal Algorithm Configuration pdf

András György, Csaba Szepesvári, Gellért Weisz, 2018, ICML.

On the rate-distortion function of random vectors and stationary sources with mixed distributions

Tamás Linder, András György, Kenneth Zeger, 1999, IEEE Trans. Inf. Theory.

Average age of information with hybrid ARQ under a resource constraint

Deniz Gündüz, András György, Elif Tugce Ceran, 2017, 2018 IEEE Wireless Communications and Networking Conference (WCNC).

Scalable Metric Learning for Co-Embedding

Martha White, Dale Schuurmans, András György, 2015, ECML/PKDD.

Soft computing control of Type 1 diabetes described at molecular levels

Levente Kovács, András György, Balázs Benyó, 2009, 2009 5th International Symposium on Applied Computational Intelligence and Informatics.

A Weakness Measure for GR(1) Formulae

Dalal Alrajeh, András György, Davide G. Cavezza, 2018, Formal Aspects of Computing.

Deterministic Independent Component Analysis

András György, Csaba Szepesvári, Ruitong Huang, 2015, ICML.

Investigating the Applicability of qALPV Modeling to ICU Models for Glycaemic Control

Levente Kovács, Christopher E. Hann, J. Geoffrey Chase, 2010 .

Learning from Delayed Outcomes with Intermediate Observations pdf

András György, Timothy A. Mann, Sven Gowal, 2018, ArXiv.

Sharing Resources Can Lead to Monostability in a Network of Bistable Toggle Switches

András György, A. György, 2019, IEEE Control. Syst. Lett..

Early Identification of Peer-to-Peer Traffic

Béla Hullár, Sándor Laki, András György, 2011, 2011 IEEE International Conference on Communications (ICC).

Optimal entropy-constrained scalar quantization of a uniform source

Tamás Linder, András György, A. György, 2000, IEEE Trans. Inf. Theory.

Analyzing a novel model of human blood glucose system at molecular levels

Levente Kovács, András György, Zoltán Benyó, 2009, 2009 European Control Conference (ECC).

A "follow the perturbed leader"-type algorithm for zero-delay quantization of individual sequences

Tamás Linder, András György, Gábor Lugosi, 2004, Data Compression Conference, 2004. Proceedings. DCC 2004.

The Shortest Path Problem Under Partial Monitoring

Tamás Linder, András György, György Ottucsák, 2006, COLT.

On Learning the Optimal Waiting Time

Tor Lattimore, András György, Csaba Szepesvári, 2014, ALT.

Chaining Bounds for Empirical Risk Minimization pdf

András György, Csaba Szepesvári, Gábor Balázs, 2016, ArXiv.

The On-Line Shortest Path Problem Under Partial Monitoring pdf

Tamás Linder, András György, Gábor Lugosi, 2007, J. Mach. Learn. Res..

A Reinforcement Learning Approach to Age of Information in Multi-User Networks

Deniz Gündüz, András György, Elif Tugce Ceran, 2018, 2018 IEEE 29th Annual International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC).

Új módszerek az adattömörítésben = New methods in data compression

András György, 2010 .

A Modular Analysis of Adaptive (Non-)Convex Optimization: Optimism, Composite Objectives, and Variational Bounds

András György, Csaba Szepesvári, Pooria Joulani, 2017, ALT.

Multicast-Aware Proactive Caching in Wireless Networks with Deep Reinforcement Learning

Deniz Gündüz, András György, Samuel O. Somuyiwa, 2019, 2019 IEEE 20th International Workshop on Signal Processing Advances in Wireless Communications (SPAWC).

Max-affine estimators for convex stochastic programming pdf

András György, Csaba Szepesvári, Gábor Balázs, 2016, ArXiv.

Average Age of Information With Hybrid ARQ Under a Resource Constraint

Deniz Gündüz, András György, Elif Tuğçe Ceran, 2019, IEEE Transactions on Wireless Communications.

Modular Composition of Gene Transcription Networks

Domitilla Del Vecchio, András György, A. György, 2014, PLoS Comput. Biol..

A unified modular analysis of online and stochastic optimization: adaptivity, optimism, non-convexity

András György, Csaba Szepesvári, Pooria Joulani, 2016, NIPS 2016.

Online Learning under Delayed Feedback

András György, Csaba Szepesvári, Pooria Joulani, 2013, ICML.

Near-Optimal Rates for Limited-Delay Universal Lossy Source Coding

András György, Gergely Neu, 2014, IEEE Transactions on Information Theory.